Method and system for filtering compressed video images

ABSTRACT

A video compression error signal in a video compression scheme is affected by random and high frequency impulse noise. An error signal suppressor containing two filters is applied to the video compression error signal. The first filter reduces or eliminates random noise. The second filter eliminates high frequency impulse noise. Random and high frequency noise is reduced or eliminated from frequencies that are unimportant to human visual perception. The error signal suppressor reduces the overall video compression bitrate by up to between 10% and 20% which provides corresponding increases in video compression and transmission efficiency. The error signal suppressor is used in video compression encoding schemes such as MPEG to reduce random and high frequency noise.

FIELD OF THE INVENTION

The present invention relates to processes for compressing digital videosignals and, in particular, to an object-based digital video encodingprocess with error feedback to increase accuracy, and filtering of thedigital video compression error signal to reduce random and impulse highfrequency noise.

BACKGROUND OF THE INVENTION

Full-motion video displays based upon analog video signals have longbeen available in the form of television. With recent increases incomputer processing capabilities and affordability, full-motion videodisplays based upon digital video signals are becoming more widelyavailable. Digital video systems can provide significant improvementsover conventional analog video systems in creating, modifying,transmitting, storing, and playing full-motion video sequences.

Digital video displays include large numbers of image frames that areplayed or rendered successively at frequencies of between 30 and 75 Hz.Each image frame is a still image formed from an array of pixelsaccording to the display resolution of a particular system. As examples,VHS-based systems have display resolutions of 320×480 pixels, NTSC-basedsystems have display resolutions of 720×486 pixels, and high-definitiontelevision (HDTV) systems under development have display resolutions of1360×1024 pixels.

The amounts of raw digital information included in video sequences aremassive. Storage and transmission of these amounts of video informationis infeasible with conventional personal computer equipment. Withreference to a digitized form of a relatively low resolution VHS imageformat having a 320×480 pixel resolution, a full-length motion pictureof two hours in duration could correspond to 100 gigabytes of digitalvideo information. By comparison, conventional compact optical diskshave capacities of about 0.6 gigabytes, magnetic hard disks havecapacities of 1-2 gigabytes, and compact optical disks under developmenthave capacities of up to 8 gigabytes.

In response to the limitations in storing or transmitting such massiveamounts of digital video information, various video compressionstandards or processes have been established, including MPEG-1, MPEG-2,and H.26X. These conventional video compression techniques utilizesimilarities between successive image frames, referred to as temporal orinterframe correlation, to provide interframe compression in whichpixel-based representations of image frames are converted to motionrepresentations. In addition, the conventional video compressiontechniques utilize similarities within image frames, referred to asspatial or intraframe correlation, to provide intraframe compression inwhich the motion representations within an image frame are furthercompressed. Intraframe compression is based upon conventional processesfor compressing still images, such as discrete cosine transform (DCT)encoding.

Although differing in specific implementations, the MPEG-1, MPEG-2, andH.26X video compression standards are similar in a number of respects.The following description of the MPEG-2 video compression standard isgenerally applicable to the others.

MPEG-2 provides interframe compression and intraframe compression basedupon square blocks or arrays of pixels in video images. A video image isdivided into transformation blocks having dimensions of 16×16 pixels.For each transformation block T_(N) in an image frame N, a search isperformed across the image of a next successive video frame N+1 orimmediately preceding image frame N-1 (i.e., bidirectionally) toidentify the most similar respective transformation blocks T_(N+1) orT_(N-1).

Ideally, and with reference to a search of the next successive imageframe, the pixels in transformation blocks T_(N) and T_(N+1) areidentical, even if the transformation blocks have different positions intheir respective image frames. Under these circumstances, the pixelinformation in transformation block T_(N+1) is redundant to that intransformation block T_(N). Compression is achieved by substituting thepositional translation between transformation blocks T_(N) and T_(N+1)for the pixel information in transformation block T_(N+1). In thissimplified example, a single translational vector (ΔX,ΔY) is designatedfor the video information associated with the 256 pixels intransformation block T_(N+1).

Frequently, the video information (i.e., pixels) in the correspondingtransformation blocks T_(N) and T_(N+1) are not identical. Thedifference between them is designated a transformation block error E,which often is significant. Although it is compressed by a conventionalcompression process such as discrete cosine transform (DCT) encoding,the transformation block error E is cumbersome and limits the extent(ratio) and the accuracy by which video signals can be compressed.

Large transformation block errors E arise in block-based videocompression methods for several reasons. The block-based motionestimation represents only translational motion between successive imageframes. The only change between corresponding transformation blocksT_(N) and T_(N+1) that can be represented are changes in the relativepositions of the transformation blocks. A disadvantage of suchrepresentations is that full-motion video sequences frequently includecomplex motions other than translation, such as rotation, magnificationand shear. Representing such complex motions with simple translationalapproximations results in the significant errors.

Another aspect of video displays is that they typically include multipleimage features or objects that change or move relative to each other.Objects may be distinct characters, articles, or scenery within a videodisplay. With respect to a scene in a motion picture, for example, eachof the characters (i.e., actors) and articles (i.e., props) in the scenecould be a different object.

The relative motion between objects in a video sequence is anothersource of significant transformation block errors E in conventionalvideo compression processes. Due to the regular configuration and sizeof the transformation blocks, many of them encompass portions ofdifferent objects. Relative motion between the objects during successiveimage frames can result in extremely low correlation (i.e., hightransformation errors E) between corresponding transformation blocks.Similarly, the appearance of portions of objects in successive imageframes (e.g., when a character turns) also introduces hightransformation errors E.

Conventional video compression methods appear to be inherently limiteddue to the size of transformation errors E. With the increased demandfor digital video display capabilities, improved digital videocompression processes are required.

In addition to the problems with transformation block errors E justdescribed, compression errors arise from random noise (e.g.,analog-to-digital conversion noise, quantization errors during signalsampling, etc.) and high frequency impulse noise (e.g., large changes inluminance and chromaticity in a very small area) that often areintroduced using conventional video compression methods. High frequencyand random noise increases the compression error, which in turnincreases the number of bits or bitrate required to represent the videodata. High frequency noise is particularly detrimental to any videocompression scheme using frequency based encoders such as DCT, wavelet,etc. An increase in the compression error bitrate decreases the overallefficiency at which a video image can be compressed and transmitted.

It is therefore desirable to reduce random and high frequency impulsenoise introduced into the compression error during the video compressionprocess. But, conventional reduction of noise during the videocompression process primarily reduces random noise without reducing highfrequency impulse noise. Moreover, eliminating high frequency impulsenoise from the compression error used for motion estimation andcompensation can significantly degrade quality of the underlying videoinformation.

High frequency impulse noise includes information relating to the videodata. Simple discarding of high frequency impulse noise also discardsvideo data information in the compression error, thereby reducing theoverall quality of the compressed video image. Accordingly, conventionalvideo compression processes have had inadequate reduction of randomnoise and high frequency impulse noise together.

SUMMARY OF THE INVENTION

The present invention includes a video compression encoder process forcompressing digitized video signals representing display motion in videosequences of multiple image frames. The encoder process utilizesobject-based video compression to improve the accuracy and versatilityof encoding interframe motion and intraframe image features. Videoinformation is compressed relative to objects of arbitraryconfigurations, rather than fixed, regular arrays of pixels as inconventional video compression methods. This reduces the errorcomponents and thereby improves the compression efficiency and accuracy.As another benefit, object-based video compression of this inventionprovides interactive video editing capabilities for processingcompressed video information.

In a preferred embodiment, the process or method of this inventionincludes identifying image features of arbitrary configuration in afirst video image frame and defining within the image feature multipledistinct feature points. The feature points of the image feature in thefirst video image frame are correlated with corresponding feature pointsof the image feature in a succeeding second video image frame, therebyto determine an estimation of the image feature in the second videoimage frame. A difference between the estimated and actual image featurein the second video image frame is determined and encoded in acompressed format.

The encoder process of this invention overcomes the shortcomings of theconventional block-based video compression methods. The encoder processpreferably uses a multi-dimensional transformation method to representmappings between corresponding objects in successive image frames. Themultiple dimensions of the transformation refer to the number ofcoordinates in its generalized form. The multi-dimensionaltransformation is capable of representing complex motion that includesany or all of translation, rotation, magnification, and shear. As aresult, complex motion of objects between successive image frames may berepresented with relatively low transformation error.

Another source of error in conventional block-based video compressionmethods is motion between objects included within a transformationblock. The object-based video compression or encoding of this inventionsubstantially eliminates the relative motion between objects withintransformation blocks. As a result, transformation error arising frominter-object motion also is substantially decreased. The lowtransformation errors arising from the encoder process of this inventionallow it to provide compression ratios up to 300% greater than thoseobtainable from prior encoder processes such as MPEG-2.

To reduce the discernible random and high frequency impulse noise fromthe compression error, an error signal suppression method or suppressoris used on the compression error during the video compression process.The error signal suppressor applies to the error signal an errorthreshold that reduces or eliminates random noise and a cross-shapedmedian filter that reduces or eliminates high frequency impulse noise.The error signal suppressor reduces the overall compression errorbitrate by up to between 10% and 20%, which provides correspondingincreases in video data compression and transmission efficiency. Usingthe error signal suppressor, the high frequency noise is reduced oreliminated from frequencies that are unimportant to human visualperception. Thus, random and high frequency noise is reduced in thecompression error without affecting the discernible visual quality ofthe video image.

The foregoing and other features and advantages of the preferredembodiment of the present invention will be more readily apparent fromthe following detailed description, which proceeds with reference to theaccompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a computer system that may be used toimplement a method and apparatus embodying the invention.

FIGS. 2A and 2B are simplified representations of a display screen of avideo display device showing two successive image frames correspondingto a video signal.

FIG. 3A is a generalized functional block diagram of a video compressionencoder process for compressing digitized video signals representingdisplay motion in video sequences of multiple image frames. FIG. 3B is afunctional block diagram of a master object encoder process according tothis invention.

FIG. 4 is a functional block diagram of an object segmentation processfor segmenting selected objects from an image frame of a video sequence.

FIG. 5A is simplified representation of display screen of the videodisplay device of FIG. 2A, and FIG. 5B is an enlarged representation ofa portion of the display screen of FIG. 5A.

FIG. 6 is a functional block diagram of a polygon match process fordetermining a motion vector for corresponding pairs of pixels incorresponding objects in successive image frames.

FIGS. 7A and 7B are simplified representations of a display screenshowing two successive image frames with two corresponding objects.

FIG. 8 is a functional block diagram of an alternative pixel blockcorrelation process.

FIG. 9A is a schematic representation of a first pixel block used foridentifying corresponding pixels in different image frames. FIG. 9B, isa schematic representation of an array of pixels corresponding to asearch area in a prior image frame where corresponding pixels aresought. FIGS. 9C-9G are schematic representations of the first pixelblock being scanned across the pixel array of FIG. 9B to identifycorresponding pixels.

FIG. 10A is a schematic representation of a second pixel block used foridentifying corresponding pixels in different image frames. FIGS.10B-10F are schematic representations of the second pixel block beingscanned across the pixel array of FIG. 9B to identify correspondingpixels.

FIG. 11A is a schematic representation of a third pixel block used foridentifying corresponding pixels in different image frames. FIGS.11B-11F are schematic representations of the third pixel block beingscanned across the pixel array of FIG. 9B.

FIG. 12 is a function block diagram of a multi-dimensionaltransformation method that includes generating a mapping between objectsin first and second successive image frames and quantitizing the mappingfor transmission or storage.

FIG. 13 is a simplified representation of a display screen showing theimage frame of FIG. 7B for purposes of illustrating themulti-dimensional transformation method of FIG. 12.

FIG. 14 is an enlarged simplified representation showing three selectedpixels of a transformation block used in the quantization of affinetransformation coefficients determined by the method of FIG. 12.

FIG. 15 is a functional block diagram of a transformation blockoptimization method utilized in an alternative embodiment of themulti-dimensional transformation method of FIG. 12.

FIG. 16 is a simplified fragmentary representation of a display screenshowing the image frame of FIG. 7B for purposes of illustrating thetransformation block optimization method of FIG. 15.

FIGS. 17A and 17B are a functional block diagram of a precompressionextrapolation method for extrapolating image features of arbitraryconfiguration to a predefined configuration to facilitate compression.

FIGS. 18A-18D are representations of a display screen on which a simpleobject is rendered to show various aspects of the extrapolation methodof FIG. 14.

FIGS. 19A and 19B are functional block diagrams of an encoder method anda decoder method, respectively, employing a Laplacian pyramid encodermethod in accordance with this invention.

FIGS. 20A-20D are simplified representations of the color componentvalues of an arbitrary set or array of pixels processed according to theencoder process of FIG. 19A.

FIG. 21 is a functional block diagram of a motion vector encodingprocess according to this invention.

FIG. 22 is a functional block diagram of an alternative quantized objectencoder-decoder process.

FIG. 23A is a generalized functional block diagram of a videocompression decoder process matched to the encoder process of FIG. 3.FIG. 23B is a functional diagram of a master object decoder processaccording to this invention.

FIG. 24A is a diagrammatic representation of a conventional chain codeformat. FIG. 24B is a simplified representation of an exemplary contourfor processing with the chain code format of FIG. 24A.

FIG. 25A is a functional block diagram of a chain coding process of thisinvention.

FIG. 25B is a diagrammatic representation of a chain code format of thepresent invention.

FIG. 25C is a diagrammatic representation of special case chain codemodifications used in the process of FIG. 25A.

FIG. 26 is a functional block diagram of a sprite generating or encodingprocess.

FIGS. 27A and 27B are respective first and second objects defined bybitmaps and showing grids of triangles superimposed over the objects inaccordance with the process of FIG. 26.

FIG. 28.is a functional block diagram of a sprite decoding processcorresponding to the encoding process of FIG. 26.

FIG. 29 is a block diagram including the error signal suppressor block.

FIG. 30 is a block diagram of the error signal suppressor block.

FIG. 31A is a diagrammatic representation of high and low frequencynoise components of an error signal.

FIG. 31B is a diagrammatic representation of the error signal of FIG.31A with the high frequency noise component removed.

FIG. 32A is a block diagram showing a cross-shaped median filter.

FIG. 32B is a block diagram showing a specific example of a cross-shapedmedian filter of FIG. 32A.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

Referring to FIG. 1, an operating environment for the preferredembodiment of the present invention is a computer system 20, either of ageneral purpose or a dedicated type, that comprises at least one highspeed processing unit (CPU) 22, in conjunction with a memory system 24,an input device 26, and an output device 28. These elements areinterconnected by a bus structure 30.

The illustrated CPU 22 is of familiar design and includes an ALU 32 forperforming computations, a collection of registers 34 for temporarystorage of data and instructions, and a control unit 36 for controllingoperation of the system 20. CPU 22 may be a processor having any of avariety of architectures including Alpha from Digital, MIPS from MIPSTechnology, NEC, IDT, Siemens, and others, x86 from Intel and others,including Cyrix, AMD, and Nexgen, and the PowerPc from IBM and Motorola.

The memory system 24 includes main memory 38 and secondary storage 40.Illustrated main memory 38 takes the form of 16 megabytes ofsemiconductor RAM memory. Secondary storage 40 takes the form of longterm storage, such as ROM, optical or magnetic disks, flash memory, ortape. Those skilled in the art will appreciate that memory system 24 maycomprise many other alternative components.

The input and output devices 26, 28 are also familiar. The input device26 can comprise a keyboard, a mouse, a physical transducer (e.g., amicrophone), etc. The output device 28 can comprise a display, aprinter, a transducer (e.g. a speaker), etc. Some devices, such as anetwork interface or a modem, can be used as input and/or outputdevices.

As is familiar to those skilled in the art, the computer system 20further includes an operating system and at least one applicationprogram. The operating system is the set of software which controls thecomputer system's operation and the allocation of resources. Theapplication program is the set of software that performs a task desiredby the user, making use of computer resources made available through theoperating system. Both are resident in the illustrated memory system 24.

In accordance with the practices of persons skilled in the art ofcomputer programming, the present invention is described below withreference to symbolic representations of operations that are performedby computer system 20, unless indicated otherwise. Such operations aresometimes referred to as being computer-executed. It will be appreciatedthat the operations which are symbolically represented include themanipulation by CPU 22 of electrical signals representing data bits andthe maintenance of data bits at memory locations in memory system 24, aswell as other processing of signals. The memory locations where databits are maintained are physical locations that have particularelectrical, magnetic, or optical properties corresponding to the databits.

FIGS. 2A and 2B are simplified representations of a display screen 50 ofa video display device 52 (e.g., a television or a computer monitor)showing two successive image frames 54a and 54b of a video imagesequence represented electronically by a corresponding video signal.Video signals may be in any of a variety of video signal formatsincluding analog television video formats such as NTSC, PAL, and SECAM,and pixelated or digitized video signal formats typically used incomputer displays, such as VGA, CGA, and EGA. Preferably, the videosignals corresponding to image frames are of a digitized video signalformat, either as originally generated or by conversion from an analogvideo signal format, as is known in the art.

Image frames 54a and 54b each include a rectangular solid image feature56 and a pyramid image feature 58 that are positioned over a background60. Image features 56 and 58 in image frames 54a and 54b have differentappearances because different parts are obscured and shown. For purposesof the following description, the particular form of an image feature inan image frame is referred to as an object or, alternatively, a mask.Accordingly, rectangular solid image feature 56 is shown as rectangularsolid objects 56a and 56b in respective image frames 54a and 54b, andpyramid image feature 58 is shown as pyramid objects 58a and 58b inrespective image frames 54a and 54b.

Pyramid image feature 58 is shown with the same position and orientationin image frames 54a and 54b and would "appear" to be motionless whenshown in the video sequence. Rectangular solid 56 is shown in frames 54aand 54b with a different orientation and position relative to pyramid 58and would "appear" to be moving and rotating relative to pyramid 58 whenshown in the video sequence. These appearances of image features 58 and60 are figurative and exaggerated. The image frames of a video sequencetypically are displayed at rates in the range of 30-80 Hz. Humanperception of video motion typically requires more than two imageframes. Image frames 54a and 54b provide, therefore, a simplifiedrepresentation of a conventional video sequence for purposes ofillustrating the present invention. Moreover, it will be appreciatedthat the present invention is in no way limited to such simplified videoimages, image features, or sequences and, to the contrary, is applicableto video images and sequences of arbitrary complexity.

VIDEO COMPRESSION ENCODER PROCESS OVERVIEW

FIG. 3A is a generalized functional block diagram of a video compressionencoder process 64 for compressing digitized video signals representingdisplay motion in video sequences of multiple image frames. Compressionof video information (i.e., video sequences or signals) can provideeconomical storage and transmission of digital video information inapplications that include, for example, interactive or digitaltelevision and multimedia computer applications. For purposes ofbrevity, the reference numerals assigned to function blocks of encoderprocess 64 are used interchangeably in reference to the resultsgenerated by the function blocks.

Conventional video compression techniques utilize similarities betweensuccessive image frames, referred to as temporal or interframecorrelation, to provide interframe compression in which pixel-basedrepresentations of image frames are converted to motion representations.In addition, conventional video compression techniques utilizesimilarities within image frames, referred to as spatial or intraframecorrelation, to provide intraframe compression in which the motionrepresentations within an image frame are further compressed.

In such conventional video compression techniques, including MPEG-1,MPEG-2, and H.26X, the temporal and spatial correlations are determinedrelative to simple translations of fixed, regular (e.g., square) arraysof pixels. Video information commonly includes, however, arbitrary videomotion that cannot be represented accurately by translating squarearrays of pixels. As a consequence, conventional video compressiontechniques typically include significant error components that limit thecompression rate and accuracy.

In contrast, encoder process 64 utilizes object-based video compressionto improve the accuracy and versatility of encoding interframe motionand intraframe image features. Encoder process 64 compresses videoinformation relative to objects of arbitrary configurations, rather thanfixed, regular arrays of pixels. This reduces the error components andthereby improves the compression efficiency and accuracy. As anotherbenefit, object-based video compression provides interactive videoediting capabilities for processing compressed video information.

Referring to FIG. 3A, function block 66 indicates that user-definedobjects within image frames of a video sequence are segmented from otherobjects within the image frames. The objects may be of arbitraryconfiguration and preferably represent distinct image features in adisplay image. Segmentation includes identifying the pixels in the imageframes corresponding to the objects. The user-defined objects aredefined in each of the image frames in the video sequence. In FIGS. 2Aand 2B, for example, rectangular solid objects 56a and 56b and pyramidobjects 58a and 58b are separately segmented.

The segmented objects are represented by binary or multi-bit (e.g.,8-bit) "alphachannel" masks of the objects. The object masks indicatethe size, configuration, and position of an object on a pixel-by-pixelbasis. For purposes of simplicity, the following description is directedto binary masks in which each pixel of the object is represented by asingle binary bit rather than the typical 24-bits (i.e., 8 bits for eachof three color component values). Multi-bit (e.g., 8-bit) masks alsohave been used.

Function block 68 indicates that "feature points" of each object aredefined by a user. Feature points preferably are distinctive features oraspects of the object. For example, corners 70a-70c and corners 72a-72ccould be defined by a user as feature points of rectangular solid 56 andpyramid 58, respectively. The pixels corresponding to each object maskand its feature points in each image frame are stored in an objectdatabase included in memory system 24.

Function block 74 indicates that changes in the positions of featurepoints in successive image frames are identified and trajectoriesdetermined for the feature points between successive image frames. Thetrajectories represent the direction and extent of movement of thefeature points. Function block 76 indicates that trajectories of thefeature points in the object between prior frame N-1 and current frame Nalso is retrieved from the object data base.

Function block 78 indicates that a sparse motion transformation isdetermined for the object between prior frame N-1 and current frame N.The sparse motion transformation is based upon the feature pointtrajectories between frames N-1 and N. The sparse motion transformationprovides an approximation of the change of the object between priorframe N-1 and current frame N.

Function block 80 indicates that a mask of an object in a current frameN is retrieved from the object data base in memory system 24.

Function block 90 indicates that a quantized master object or "sprite"is formed from the objects or masks 66 corresponding to an image featurein an image frame sequence and feature point trajectories 74. The masterobject preferably includes all of the aspects or features of an objectas it is represented in multiple frames. With reference to FIGS. 2A and2B, for example, rectangular solid 56 in frame 54b includes a side 78bnot shown in frame 54a. Similarly, rectangular solid 56 includes a side78a in frame 54a not shown in frame 54b. The master object forrectangular solid 56 includes both sides 78a and 78b.

Sparse motion transformation 78 frequently will not provide a completerepresentation of the change in the object between frames N-1 and N. Forexample, an object in a prior frame N-1, such as rectangular object 54a,might not include all the features of the object in the current frame N,such as side 78b of rectangular object 54b.

To improve the accuracy of the transformation, therefore, anintersection of the masks of the object in prior frame N-1 and currentframe N is determined, such as by a logical AND function as is known inthe art. The mask of the object in the current frame N is subtractedfrom the resulting intersection to identify any portions or features ofthe object in the current frame N not included in the object in theprior frame N-1 (e.g., side 78b of rectangular object 54b, as describedabove). The newly identified portions of the object are incorporatedinto master object 90 so that it includes a complete representation ofthe object in frames N-1 and N.

Function block 96 indicates that a quantized form of an object 98 in aprior frame N-1 (e.g., rectangular solid object 56a in image frame 54a)is transformed by a dense motion transformation to provide a predictedform of the object 102 in a current frame N (e.g., rectangular solidobject 56b in image frame 54b). This transformation providesobject-based interframe compression.

The dense motion transformation preferably includes determining anaffine transformation between quantized prior object 98 in frame N-1 andthe object in the current frame N and applying the affine transformationto quantized prior object 98. The preferred affine transformation isrepresented by affine transformation coefficients 104 and is capable ofdescribing translation, rotation, magnification, and shear. The affinetransformation is determined from a dense motion estimation, preferablyincluding a pixel-by-pixel mapping, between prior quantized object 98and the object in the current frame N.

Predicted current object 102 is represented by quantized prior object98, as modified by dense motion transformation 96, and is capable ofrepresenting relatively complex motion, together with any new imageaspects obtained from master object 90. Such object-basedrepresentations are relatively accurate because the perceptual andspatial continuity associated with objects eliminates errors arisingfrom the typically changing relationships between different objects indifferent image frames. Moreover, the object-based representations allowa user to represent different objects with different levels ofresolution to optimize the relative efficiency and accuracy forrepresenting objects of varying complexity.

Function block 106 indicates that for image frame N, predicted currentobject 102 is subtracted from original object 108 for current frame N todetermine an estimated error 110 in predicted object 102. Estimatederror 110 is a compressed representation of current object 108 in imageframe N relative to quantized prior object 98. More specifically,current object 108 may be decoded or reconstructed from estimated error110 and quantized prior object 98.

Function block 112 indicates that estimated error 110 is compressed or"coded" by a conventional "lossy" still image compression method such aslattice subband (wavelet) compression or encoding as described inMultirate Systems and Filter Banks by Vaidyanathan, PTR Prentice-Hall,Inc., Englewood Cliffs, N.J., (1993) or discrete cosine transform (DCT)encoding as described in JPEG: Still Image Data Compression Standard byPennebaker et al., Van Nostrand Reinhold, New York (1993).

As is known in the art, "lossy" compression methods introduce some datadistortion to provide increased data compression. The data distortionrefers to variations between the original data before compression andthe data resulting after compression and decompression. For purposes ofillustration below, the compression or encoding of function block 102 ispresumed to be wavelet encoding.

Function block 114 indicates that the wavelet encoded estimated errorfrom function block 112 is further compressed or "coded" by aconventional "lossless" still image compression method to formcompressed data 116. A preferred conventional "lossless" still imagecompression method is entropy encoding as described in JPEG: Still ImageData Compression Standard by Pennebaker et al. As is known in the art,"lossless" compression methods introduce no data distortion.

An error feedback loop 118 utilizes the wavelet encoded estimated errorfrom function block 112 for the object in frame N to obtain a priorquantized object for succeeding frame N+1. As an initial step infeedback loop 118, function block 120 indicates that the wavelet encodedestimated error from function block 112 is inverse wavelet coded, orwavelet decoded, to form a quantized error 122 for the object in imageframe N.

The effect of successively encoding and decoding estimated error 110 bya lossy still image compression method is to omit from quantized error122 video information that is generally imperceptible by viewers. Thisinformation typically is of higher frequencies. As a result, omittingsuch higher frequency components typically can provide image compressionof up to about 200% with only minimal degradation of image quality.

Function block 124 indicates that quantized error 122 and predictedobject 102, both for image frame N, are added together to form aquantized object 126 for image frame N. After a timing coordinationdelay 128, quantized object 126 becomes quantized prior object 98 and isused as the basis for processing the corresponding object in image frameN+1.

Encoder process 64 utilizes the temporal correlation of correspondingobjects in successive image frames to obtain improved interframecompression, and also utilizes the spatial correlation within objects toobtain accurate and efficient intraframe compression. For the interframecompression, motion estimation and compensation are performed so that anobject defined in one frame can be estimated in a successive frame. Themotion-based estimation of the object in the successive frame requiressignificantly less information than a conventional block-basedrepresentation of the object. For the intraframe compression, anestimated error signal for each object is compressed to utilize thespatial correlation of the object within a frame and to allow differentobjects to be represented at different resolutions. Feedback loop 118allows objects in subsequent frames to be predicted from fullydecompressed objects, thereby preventing accumulation of estimationerror.

Encoder process 64 provides as an output a compressed or encodedrepresentation of a digitized video signal representing display motionin video sequences of multiple image frames. The compressed or encodedrepresentation includes object masks 66, feature points 68, affinetransform coefficients 104, and compressed error data 116. The encodedrepresentation may be stored or transmitted, according to the particularapplication in which the video information is used.

FIG. 3B is a functional block diagram of a master object encoder process130 for encoding or compressing master object 90. Function block 132indicates that master object 90 is compressed or coded by a conventional"lossy" still image compression method such as lattice subband (wavelet)compression or discrete cosine transform (DCT) encoding. Preferably,function block 132 employs wavelet encoding.

Function block 134 indicates that the wavelet encoded master object fromfunction block 132 is further compressed or coded by a conventional"lossless" still image compression method to form compressed masterobject data 136. A preferred conventional lossless still imagecompression method is entropy encoding.

Encoder process 130 provides as an output compressed master object 136.Together with the compressed or encoded representations provided byencoder process 64, compressed master object 136 may be decompressed ordecoded after storage or transmission to obtain a video sequence ofmultiple image frames.

Encoder process 64 is described with reference to encoding videoinformation corresponding to a single object with object within an imageframe. As shown in FIGS. 2A and 2B and indicated above, encoder process64 is performed separately for each of the objects (e.g., objects 56 and58 of FIGS. 2A and 2B) in an image frame. Moreover, many video imagesinclude a background over which arbitrary numbers of image features orobjects are rendered. Preferably, the background is processed as anobject according to this invention after all user-designated objects areprocessed.

Processing of the objects in an image frame requires that the objects beseparately identified. Preferably, encoder process 64 is applied to theobjects of an image frame beginning with the forward-most object orobjects and proceeding successively to the back-most object (e.g., thebackground). The compositing of the encoded objects into a video imagepreferably proceeds from the rear-most object (e.g., the background) andproceeds successively to the forward-most object (e.g., rectangularsolid 56 in FIGS. 2A and 2B). The layering of encoding objects may becommunicated as distinct layering data associated with the objects of animage frame or, alternatively, by transmitting or obtaining the encodedobjects in a sequence corresponding to the layering or compositingsequence.

OBJECT SEGMENTATION AND TRACKING

In a preferred embodiment, the segmentation of objects within imageframes referred to in function block 66 allows interactive segmentationby users. The object segmentation of this invention provides improvedaccuracy in segmenting objects and is relatively fast and provides userswith optimal flexibility in defining objects to be segmented.

FIG. 4 is a functional block diagram of an object segmentation process140 for segmenting selected objects from an image frame of a videosequence. Object segmentation according to process 140 provides aperceptual grouping of objects that is accurate and quick and easy forusers to define.

FIG. 5A is simplified representation of display screen 50 of videodisplay device 52 showing image frame 54a and the segmentation ofrectangular solid object 56a. In its rendering on display screen 50,rectangular solid object 56a includes an object perimeter 142 (shownspaced apart from object 56a for clarity) that bounds an object interior144. Object interior 144 refers to the outline of object 56a on displayscreen 50 and in general may correspond to an inner surface or, asshown, an outer surface of the image feature. FIG. 5B is an enlargedrepresentation of a portion of display screen 50 showing thesemi-automatic segmentation of rectangular solid object 56a. Thefollowing description is made with specific reference to rectangularsolid object 56a, but is similarly applicable to each object to besegmented from an image frame.

Function block 146 indicates that a user forms within object interior144 an interior outline 148 of object perimeter 142. The user preferablyforms interior outline 148 with a conventional pointer or cursor controldevice, such as a mouse or trackball. Interior outline 148 is formedwithin a nominal distance 150 from object perimeter 142. Nominaldistance 150 is selected by a user to be sufficiently large that theuser can form interior outline 148 relatively quickly within nominaldistance 150 of perimeter 142. Nominal distance 150 corresponds, forexample, to between about 4 and 10 pixels.

Function block 146 is performed in connection with a key frame of avideo sequence. With reference to a scene in a conventional motionpicture, for example, the key frame could be the first frame of themultiple frames in a scene. The participation of the user in thisfunction renders object segmentation process 140 semi-automatic, butsignificantly increases the accuracy and flexibility with which objectsare segmented. Other than for the key frame, objects in subsequent imageframes are segmented automatically as described below in greater detail.

Function block 152 indicates that interior outline 148 is expandedautomatically to form an exterior outline 156. The formation of exterioroutline 156 is performed as a relatively simple image magnification ofoutline 148 so that exterior outline 156 is a user-defined number ofpixels from interior outline 148. Preferably, the distance betweeninterior outline 148 and exterior outline 156 is approximately twicedistance 150.

Function block 158 indicates that pixels between interior outline 148and exterior outline 156 are classified according to predefinedattributes as to whether they are within object interior 144, thereby toidentify automatically object perimeter 142 and a corresponding mask 80of the type described with reference to FIG. 3A. Preferably, the imageattributes include pixel color and position, but either attribute couldbe used alone or with other attributes.

In the preferred embodiment, each of the pixels in interior outline 148and exterior outline 156 defines a "cluster center" represented as afive-dimensional vector in the form of (r, g, b, x, y). The terms r, g,and b correspond to the respective red, green, and blue color componentsassociated with each of the pixels, and the terms x and y correspond tothe pixel locations. The m-number of cluster center vectorscorresponding to pixels in interior outline 148 are denoted as {I₀, I₁,. . . , I_(m-1) }, and the n-number of cluster center vectorscorresponding pixels in exterior outline 156 are denoted as {O₀, O₁, . .. , O_(n-1) }.

Pixels between the cluster center vectors I_(i) and O_(j) are classifiedby identifying the vector to which each pixel is closest in thefive-dimensional vector space. For each pixel, the absolute distanced_(i) and d_(j) to each of respective cluster center vectors I_(i) andO_(j) is computed according to the following equations:

    d.sub.i =w.sub.color (|r-r.sub.i |+|g-g.sub.i |+|b-b.sub.i |)+w.sub.coord (|x-x.sub.i |+|y-y.sub.i |),

    0≦i<m,

    d.sub.j =w.sub.color (|r-r.sub.j |+|g-g.sub.j |+|b-b.sub.j |)+w.sub.coord (|x-x.sub.j |+|y-y.sub.j |),

    0≦j<n,

in which w_(color) and w_(coord) are weighting factors for therespective color and pixel position information. Weighting factorsw_(color) and w_(coord) are of values having a sum of 1 and otherwiseselectable by a user. Preferably, weighting factors w_(color) andW_(coord) are of an equal value of 0.5. Each pixel is associated withobject interior 144 or exterior according to the minimumfive-dimensional distance to one of the cluster center vectors I_(i) andO_(j).

Function block 162 indicates that a user selects at least two, andpreferable more (e.g. 4 to 6), feature points in each object of aninitial or key frame. Preferably, the feature points are relativelydistinctive aspects of the object. With reference to rectangular solidimage feature 56, for example, corners 70a-70c could be selected asfeature points.

Function block 164 indicates that a block 166 of multiple pixelscentered about each selected feature point (e.g., corners 70a-70c) isdefined and matched to a corresponding block in a subsequent image frame(e.g., the next successive image frame). Pixel block 166 is userdefined, but preferably includes a 32×32 pixel array that includes onlypixels within image interior 144. Any pixels 168 (indicated bycross-hatching) of pixel block 166 falling outside object interior 144as determined by function block 158 (e.g., corners 70b and 70c) areomitted. Pixel blocks 166 are matched to the corresponding pixel blocksin the next image frame according to a minimum absolute error identifiedby a conventional block match process or a polygon match process, asdescribed below in greater detail.

Function block 170 indicates that a sparse motion transformation of anobject is determined from the corresponding feature points in twosuccessive image frames. Function block 172 indicates that mask 80 ofthe current image frame is transformed according to the sparse motiontransformation to provide an estimation of the mask 80 for the nextimage frame. Any feature point in a current frame not identified in asuccessive image frame is disregarded.

Function block 174 indicates that the resulting estimation of mask 80for the next image frame is delayed by one frame, and functions as anoutline 176 for a next successive cycle. Similarly, function block 178indicates that the corresponding feature points also are delayed by oneframe, and utilized as the initial feature points 180 for the nextsuccessive frame.

POLYGON MATCH METHOD

FIG. 6 is a functional block diagram of a polygon match process 200 fordetermining a motion vector for each corresponding pair of pixels insuccessive image frames. Such a dense motion vector determinationprovides the basis for determining the dense motion transformations 96of FIG. 3A.

Polygon match process 200 is capable of determining extensive motionbetween successive image frames like the conventional block matchprocess. In contrast to the conventional block match process, however,polygon match process 200 maintains its accuracy for pixels located nearor at an object perimeter and generates significantly less error. Apreferred embodiment of polygon match method 200 has improvedcomputational efficiency.

Polygon block method 200 is described with reference to FIGS. 7A and 7B,which are simplified representations of display screen 50 showing twosuccessive image frames 202a and 202b in which an image feature 204 isrendered as objects 204a and 204b, respectively.

Function block 206 indicates that objects 204a and 204b for image frames202a and 202b are identified and segmented by, for example, objectsegmentation method 140.

Function block 208 indicates that dimensions are determined for a pixelblock 210b (e.g., 15×15 pixels) to be applied to object 204b and asearch area 212 about object 204a. Pixel block 210b defines a regionabout each pixel in object 204b for which region a corresponding pixelblock 210a is identified in object 204a. Search area 212 establishes aregion within which corresponding pixel block 210a is sought.Preferably, pixel block 210b and search area 212 are right regulararrays of pixels and of sizes defined by the user.

Function block 214 indicates that an initial pixel 216 in object 204b isidentified and designated the current pixel. Initial pixel 216 may bedefined by any of a variety of criteria such as, for example, the pixelat the location of greatest vertical extent and minimum horizontalextent. With the pixels on display screen 50 arranged according to acoordinate axis 220 as shown, initial pixel 216 may be represented asthe pixel of object 214b having a maximum y-coordinate value and aminimum x-coordinate value.

Function block 222 indicates that pixel block 210b is centered at andextends about the current pixel.

Function block 224 represents an inquiry as to whether pixel block 210bincludes pixels that are not included in object 204b (e.g., pixels 226shown by cross-hatching in FIG. 7B). This inquiry is made with referenceto the objects identified according to function block 206. Wheneverpixels within pixel block 210b positioned at the current pixel falloutside object 204b, function block 224 proceeds to function block 228and otherwise proceeds to function block 232.

Function block 228 indicates that pixels of pixel block 210b fallingoutside object 204b (e.g., pixels 226) are omitted from the regiondefined by pixel block 210b so that it includes only pixels withinobject 204b. As a result, pixel block 210b defines a region thattypically would be of a polygonal shape more complex than the originallydefined square or rectangular region.

Function block 232 indicates that a pixel in object 204a is identifiedas corresponding to the current pixel in object 204b. The pixel inobject 204a is referred to as the prior corresponding pixel. Preferably,the prior corresponding pixel is identified by forming a pixel block210a about each pixel in search area 212 and determining a correlationbetween the pixel block 210a and pixel block 210b about the currentpixel in object 204b. Each correlation between pixel blocks 210a and210b may be determined, for example, a means absolute error. The priorcorresponding pixel is identified by identifying the pixel block 210a insearch area 212 for which the mean absolute error relative to pixelblock 210b is minimized. A mean absolute error E for a pixel block 210arelative to pixel block 210b may be determined as: ##EQU1## in which theterms r_(ij), g_(ij), and b_(ij) correspond to the respective red,green, and blue color components associated with each of the pixels inpixel block 210b and the terms r_(ij) ', g_(ij) ', and b_(ij) 'correspond to the respective red, green, and blue color componentsassociated with each of the pixels in pixel block 210a.

As set forth above, the summations for the mean absolute error E implypixel blocks having pixel arrays having mxn pixel dimensions. Pixelblocks 210b of polygonal configuration are accommodated relativelysimply by, for example, defining zero values for the color components ofall pixels outside polygonal pixel blocks 210b.

Function block 234 indicates that a motion vector MV between each pixelin object 204b and the corresponding prior pixel in object 204a isdetermined. A motion vector is defined as the difference between thelocations of the pixel in object 204b and the corresponding prior pixelin object 204a:

    MV=(|x.sub.i -x.sub.k '|, |y.sub.j -y.sub.l '|),

in which the terms x_(i) and y_(j) correspond to the respective x- andy-coordinate positions of the pixel in pixel block 210b, and the termsx_(k) ' and y_(l) ' correspond to the respective x- and y-coordinatepositions of the corresponding prior pixel in pixel block 210a.

Function block 236 represents an inquiry as to whether object 204bincludes any remaining pixels. Whenever object 204b includes remainingpixels, function block 236 proceeds to function block 238 and otherwiseproceeds to end block 240.

Function block 238 indicates that a next pixel in object 204b isidentified according to a predetermined format or sequence. With theinitial pixel selected as described above in reference to function block214, subsequent pixels may be defined by first identifying the nextadjacent pixel in a row (i.e., of a common y-coordinate value) and, ifobject 204 includes no other pixels in a row, proceeding to the first orleft-most pixel (i.e., of minimum x-coordinate value) in a next lowerrow. The pixel so identified is designated the current pixel andfunction block 238 returns to function block 222.

Polygon block method 200 accurately identifies corresponding pixels evenif they are located at or near an object perimeter. A significant sourceof error in conventional block matching processes is eliminated byomitting or disregarding pixels of pixel blocks 210b falling outsideobject 204b. Conventional block matching processes rigidly apply auniform pixel block configuration and are not applied with reference toa segmented object. The uniform block configurations cause significanterrors for pixels adjacent the perimeter of an object because the pixelsoutside the object can undergo significant changes as the object movesor its background changes. With such extraneous pixel variationsincluded in conventional block matching processes, pixels in thevicinity of an object perimeter cannot be correlated accurately with thecorresponding pixels in prior image frames.

For each pixel in object 204b, a corresponding prior pixel in object204a is identified by comparing pixel block 210b with a pixel block 210afor each of the pixels in prior object 204a. The corresponding priorpixel is the pixel in object 204a having the pixel block 210a that bestcorrelates to pixel block 210b. If processed in a conventional manner,such a determination can require substantial computation to identifyeach corresponding prior pixel. To illustrate, for pixel blocks havingdimensions of n×n pixels, which are significantly smaller than a searcharea 212 having dimensions of m×m pixels, approximately n² ×m²calculations are required to identify each corresponding prior pixel inthe prior object 204a.

PIXEL BLOCK CORRELATION PROCESS

FIG. 8 is a functional block diagram of a modified pixel blockcorrelation process 260 that preferably is substituted for the onedescribed with reference to function block 232. Modified correlationprocess 260 utilizes redundancy inherent in correlating pixel blocks210b and 210a to significantly reduce the number of calculationsrequired.

Correlation process 260 is described with reference to FIGS. 9A-9G and10A-10G, which schematically represent arbitrary groups of pixelscorresponding to successive image frames 202a and 202b. In particular,FIG. 9A is a schematic representation of a pixel block 262 havingdimensions of 5×5 pixels in which each letter corresponds to a differentpixel. The pixels of pixel block 262 are arranged as a right regulararray of pixels that includes distinct columns 264. FIG. 9B representsan array of pixels 266 having dimensions of q×q pixels and correspondingto a search area 212 in a prior image frame 202a. Each of the numeralsin FIG. 9B represents a different pixel. Although described withreference to a conventional right regular pixel block 262, correlationprocess 260 is similarly applicable to polygonal pixel blocks of thetype described with reference to polygon match process 200.

Function block 268 indicates that an initial pixel block (e.g., pixelblock 262) is defined with respect to a central pixel M and scannedacross a search area 212 (e.g., pixel array 266) generally in a rasterpattern (partly shown in FIG. 7A) as in a conventional block matchprocess. FIGS. 9C-9G schematically illustrate five of the approximatelyq² steps in the block matching process between pixel block 262 and pixelarray 266.

Although the scanning of pixel block 262 across pixel array 266 isperformed in a conventional manner, computations relating to thecorrelation between them are performed differently according to thisinvention. In particular, a correlation (e.g., a mean absolute error) isdetermined and stored for each column 264 of pixel block 262 in eachscan position. The correlation that is determined and stored for eachcolumn 264 of pixel block 262 in each scanned position is referred to asa column correlation 270, several of which are symbolically indicated inFIGS. 9C-9G by referring to the correlated pixels. To illustrate, FIG.9C shows a column correlation 270(1) that is determined for the singlecolumn 264 of pixel block 262 aligned with pixel array 266. Similarly,FIG. 9D shows column correlations 270(2) and 270(3) that are determinedfor the two columns 264 of pixel block 262 aligned with pixel array 266.FIGS. 9E-9G show similar column correlations with pixel block 262 atthree exemplary subsequent scan positions relative to pixel array 266.

The scanning of initial pixel block 262 over pixel array 266 provides astored array or database of column correlations. With pixel block 262having re-number of columns 264, and pixel array 266 having q×q pixels,the column correlation database includes approximately rq² number ofcolumn correlations. This number of column correlations is onlyapproximate because pixel block 262 preferably is initially scannedacross pixel array 266 such that pixel M is aligned with the first rowof pixels in pixel array 266.

The remaining steps beginning with the one indicated in FIG. 9C occurafter two complete scans of pixel block 262 across pixel array 266(i.e., with pixel M aligned with the first and second rows of pixelarray 266).

Function block 274 indicates that a next pixel block 276 (FIG. 10A) isdefined from, for example, image frame 202b with respect to a centralpixel N in the same row as pixel M. Pixel block 276 includes a column278 of pixels not included in pixel block 262 and columns 280 of pixelsincluded in pixel block 262. Pixel block 276 does not include a column282 (FIG. 9A) that was included in pixel block 262. Such an incrementaldefinition of next pixel block 276 is substantially the same as thatused in conventional block matching processes.

Function block 284 indicates that pixel block 276 is scanned acrosspixel array 266 in the manner described above with reference to functionblock 268. As with FIGS. 9C-9G, FIGS. 10B-10G represent the scanning ofpixel block 276 across pixel array 266.

Function block 286 indicates that for column 278 a column correlation isdetermined and stored at each scan position. Accordingly, columncorrelations 288(1)-288(5) are made with respect to the scannedpositions of column 278 shown in respective FIGS. 10B-10F.

Function block 290 indicates that for each of columns 280 in pixel block276 a stored column determination is retrieved for each scan positionpreviously computed and stored in function block 268. For example,column correlation 270(1) of FIG. 9C is the same as column correlation270'(1) of FIG. 10C. Similarly, column correlations 270'(2), 270'(3),270'(5)-270'(8), and 270'(15)-270'(18) of FIGS. 10D-10F are the same asthe corresponding column correlations in FIGS. 9D, 9E, and 9G. For pixelblock 276, therefore, only one column correlation 288 is calculated foreach scan position. As a result, the number of calculations required forpixel block 276 is reduced by nearly 80 percent.

Function block 292 indicates that a subsequent pixel block 294 (FIG. 1A)is defined with respect to a central pixel R in the next successive rowrelative to pixel M. Pixel block 294 includes columns 296 of pixels thatare similar to but distinct from columns 264 of pixels in pixel block262 of FIG. 9A. In particular, columns 296 include pixels A'-E' notincluded in columns 264. Such an incremental definition of subsequentpixel block 294 is substantially the same as that used in conventionalblock matching processes.

Function block 298 indicates that pixel block 294 is scanned acrosspixel array 266 (FIG. 9B) in the manner described above with referenceto function blocks 268 and 276. FIGS. 11B-11F represent the scanning ofpixel block 294 across pixel array 266.

Function block 300 indicates that a column correlation is determined andstored for each of columns 296. Accordingly, column correlations302(1)-302(18) are made with respect to the scanned positions of columns296 shown in FIGS. 11B-11F.

Each of column correlations 302(1)-302(18) may be calculated in anabbreviated manner with reference to column correlations made withrespect to pixel block 262 (FIG. 9A).

For example, column correlations 302(4)-302(8) of FIG. 11D includesubcolumn correlations 304'(4)-304'(8) that are the same as subcolumncorrelations 304(4)-304(8) of FIG. 9E. Accordingly, column correlations302(4)-302(8) may be determined from respective column correlations270(4)-270(8) by subtracting from the latter correlation values forpixels 01A, 02B, 03C, 04D, and 05E to form surespemn correlations304(4)-304(8), respectively. Column correlations 302(4)-302(8) may beobtained by adding correlation values for the pixel pairs 56A', 57B',58C', 59D' and 50E' to the respective subcolumn correlation values304(4)-304(8), respectively.

The determination of column correlations 302(4)-302(8) from respectivecolumn correlations 270(4)-270(8) entails subtracting individual pixelcorrelation values corresponding to the row of pixels A-E of pixel block262 not included in pixel block 294, and adding pixel correlation valuesfor the row of pixels A'-E' included in pixel block 294 but not pixelblock 262. This method substitutes for each of column correlations302(4)-302(8), one substraction and one addition for the five additionsthat would be required to determine each column correlation in aconventional manner. With pixel blocks of larger dimensions as arepreferred, the improvement of this method over conventional calculationmethods is even greater. Conventional block matching processes identifyonly total block correlations for each scan position of initial pixelblock 262 relative to pixel array 266. As a consequence, all correlationvalues for all pixels must be calculated separately for each scanposition. In contrast, correlation process 260 utilizes stored columncorrelations 270 to significantly reduce the number of calculationsrequired. The improvements in speed and processor resource requirementsprovided by correlation process 260 more than offset the systemrequirements for storing the column correlations.

It will be appreciated that correlation process 260 has been describedwith reference to FIGS. 9-11 to illustrate specific features of thisinvention. As shown in the illustrations, this invention includesrecurring or cyclic features that are particularly suited to executionby a computer system. These recurring or cyclic features are dependentupon the dimensions of pixel blocks and pixel arrays and are wellunderstood and can be implemented by persons skilled in the art.

MULTI-DIMENSIONAL TRANSFORMATION

FIG. 12 is a functional block diagram of a transformation method 350that includes generating a multi-dimensional transformation betweenobjects in first and second successive image frames and quantitizing themapping for transmission or storage. The multi-dimensionaltransformation preferably is utilized in connection with function block96 of FIG. 3. Transformation method 350 is described with reference toFIG. 7A and FIG. 13, the latter of which like FIG. 7B is a simplifiedrepresentation of display screen 50 showing image frame 202b in whichimage feature 204 is rendered as object 204b.

Transformation method 350 preferably provides a multi-dimensional affinetransformation capable of representing complex motion that includes anyor all of translation, rotation, magnification, and shear.Transformation method 350 provides a significant improvement overconventional video compression methods such a MPEG-1, MPEG-2, and H.26X,which are of only one dimension and represent only translation. In thisregard, the dimensionality of a transformation refers to the number ofcoordinates in the generalized form of the transformation, as describedbelow in greater detail. Increasing the accuracy with which complexmotion is represented according to this invention results in fewererrors than by conventional representations, thereby increasingcompression efficiency.

Function block 352 indicates that a dense motion estimation of thepixels in objects 204a and 204b is determined. Preferably, the densemotion estimation is obtained by polygon match process 200. As describedabove, the dense motion estimation includes motion vectors betweenpixels at coordinates (x_(i), y_(i)) in object 204b of image frame 202band corresponding pixels at locations (x_(i) ', y_(i) ') of object 204ain image frame 202a.

Function block 354 indicates that an array of transformation blocks 356is defined to encompass object 204b. Preferably, transformation blocks356 are right regular arrays of pixels having dimensions of, forexample, 32×32 pixels.

Function block 358 indicates that a multi-dimensional affinetransformation is generated for each transformation block 356.Preferably, the affine transformations are of first order andrepresented as:

    x.sub.i '=ax.sub.i +by.sub.i +c

    y.sub.i '=dx.sub.i +ey.sub.i +f,

and are determined with reference to all pixels for which the motionvectors have a relatively high confidence. These affine transformationsare of two dimensions in that x_(i) and y_(i) are defined relative totwo coordinates: x_(i) and y_(i).

The relative confidence of the motion vectors refers to the accuracywith which the motion vector between corresponding pixels can bedetermined uniquely relative to other pixels. For example, motionvectors between particular pixels that are in relatively large pixelarrays and are uniformly colored (e.g., black) cannot typically bedetermined accurately. In particular, for a black pixel in a first imageframe, many pixels in the pixel array of the subsequent image frame willhave the same correlation (i.e., mean absolute value error between pixelblocks).

In contrast, pixel arrays in which pixels correspond to distinguishingfeatures typically will have relatively high correlations for particularcorresponding pixels in successive image frames.

The relatively high correlations are preferably represented as a minimalabsolute value error determination for particular pixel. Motion vectorsof relatively high confidence may, therefore, be determined relative tosuch uniquely low error values. For example, a high confidence motionvector may be defined as one in which the minimum absolute value errorfor the motion vector is less than the next greater error valueassociated with the pixel by a difference amount that is greater than athreshold difference amount. Alternatively, high confidence motionvectors may be defined with respect to the second order derivative ofthe absolute error values upon which the correlations are determined. Asecond order derivative of more than a particular value would indicate arelatively high correlation between specific corresponding pixels.

With n-number of pixels with such high-confidence motion vectors, thepreferred affine transformation equations are solved with reference ton-number of corresponding pixels in image frames 202a and 202b. Imagesframes must include at least three corresponding pixels in image frames202a and 202b with high confidence motion vectors to solve for the sixunknown coefficients a, b, c, d, e, and f of the preferred affinetransformation equations. With the preferred dimensions, each oftransformation blocks 356 includes 2¹⁰ pixels of which significantnumbers typically have relatively high confidence motion vectors.Accordingly, the affine transformation equations are over-determined inthat a significantly greater number of pixels are available to solve forthe coefficients a, b, c, d, e, and f.

The resulting n-number of equations may be represented by the linearalgebraic expression: ##EQU2## Preferably these equations are solved bya conventional singular value decomposition (SVD) method, which providesa minimal least-square error for the approximation of the dense motionvectors. A conventional SVD method is described, for example, inNumerical Recipes in C, by Press et al., Cambridge University Press,(1992).

As described above, the preferred two-dimensional affine transformationequations are capable of representing translation, rotation,magnification, and shear of transformation blocks 356 between successiveimage frames 202a and 202b. In contrast, conventional motiontransformation methods used in prior compression standards employsimplified transformation equations of the form:

    x.sub.i '=x.sub.i +g

    y.sub.i '=y.sub.i +h

The prior simplified transformation equations represent motion by onlytwo coefficients, g and h, which represents only one-third the amount ofinformation (i.e., coefficients) obtained by the preferredmulti-dimensional transformation equations. To obtain superiorcompression of the information obtained by transformation method 350relative to conventional compression methods, the dimensions oftransformation block 356 preferably are more than three times largerthan the corresponding 16×16 pixel blocks employed in MPEG-1 and MPEG-2compression methods. The preferred 32×32 pixel dimensions oftransformation blocks 356 encompass four times the number of pixelsemployed in the transformation blocks of conventional transformationmethods. The larger dimensions of transformation blocks 356, togetherwith the improved accuracy with which the affine transformationcoefficients represent motion of the transformation blocks 356, allowtransformation method 350 to provide greater compression thanconventional compression methods.

It will be appreciated that the affine coefficients generated accordingto the present invention typically would be non-integer, floating pointvalues that could be difficult to compress adequately without adverselyaffecting their accuracy. Accordingly, it is preferable to quantize theaffine transformation coefficient to reduce the bandwidth required tostore or transmit them.

Function block 362 indicates that the affine transformation coefficientsgenerated with reference to function block 358 are quantized to reducethe bandwidth required to store or transmit them. FIG. 14 is an enlargedfragmentary representation of a transformation block 356 showing threeselected pixels, 364a, 364b, and 364c from which the six preferredaffine transformation coefficients a-f may be determined.

Pixels 364a-364c are represented as pixel coordinates (x₁,y₁), (x₂, y₂),and (x₃, y₃), respectively. Based upon the dense motion estimation offunction block 352, pixels 364a-364c have respective correspondingpixels (x₁ ', y₁ '), (y₂ ', y₂ '), (x₃ ', y₃ ') in preceding image frame202a. As is conventional, pixel locations (x_(i), y_(i)) are representedby integer values and are solutions to the affine transformationequations upon which the preferred affine transformation coefficientsare based. Accordingly, selected pixels 364a-364c are used to calculatethe corresponding pixels from the preceding image frame 202a, whichtypically will be floating point values.

Quantization of these floating point values is performed by convertingto integer format the difference between corresponding pixels (x_(i)-x'_(i), y_(i) -y'_(i)). The affine transformation coefficients aredetermined by first calculating the pixel values (x'_(i), y'_(i)) fromthe difference vectors and the pixel values (x_(i), y_(i)), and thensolving the multi-dimensional transformation equations of function block358 with respect to the pixel values (x'_(i), y'_(i)).

As shown in FIG. 14, pixels 364a-364c preferably are distributed abouttransformation block 356 to minimize the sensitivity of the quantizationto local variations within transformation block 356. Preferably, pixel364a is positioned at or adjacent the center of transformation block356, and pixels 364b and 364c are positioned at upper corners. Also inthe preferred embodiment, the selected pixels for each of thetransformation blocks 356 in object 204b have the same positions,thereby allowing the quantization process to be performed efficiently.

Another aspect of the quantization method of function block 362 is thatdifferent levels of quantization may be used to represent varyingdegrees of motion. As a result, relatively simple motion (e.g.,translation) may be represented by fewer selected pixels 364 than arerequired to represent complex motion. With respect to the affinetransformation equations described above, pixel 364a (x₁, y₁) fromobject 204b and the corresponding pixel (x₁ ', y₁ ') from object 204aare sufficient to solve simplified affine transformation equations ofthe form:

    x.sub.1 '=y.sub.1 +c

    y.sub.1 '=y.sub.1 +f,

which represent translation between successive image frames. Pixel 364aspecifically is used because its central position generally representstranslational motion independent of the other types of motion.Accordingly, a user may selectively represent simplified motion such astranslation with simplified affine transformation equations that requireone-third the data required to represent complex motion.

Similarly, a pair of selected pixels (x₁, y₁) (e.g., pixel 364a) and(x₂, y₂) (i.e., either of pixels 364b and 364c) from object 204b and thecorresponding pixels (x₁ ', y₁ ') and (x₂ ', y₂ ') from object 204a aresufficient to solve simplified affine transformation equations of theform:

    x.sub.i '=ax.sub.i +c

    y.sub.i '=ey.sub.i +f,

which are capable of representing motions that include translation andmagnification between successive image frames. In the simplified form:

    x'=a cos θx+sin θy+c

    y'=-sin θx+a cos θy+f

the corresponding pairs of selected pixels are capable of representingmotions that include translation, rotation, and isotropic magnification.In this simplified form, the common coefficients of the x and yvariables allow the equations to be solved by two corresponding pairs ofpixels.

Accordingly, a user may selectively represent moderately complex motionthat includes translation, rotation, and magnification with partlysimplified affine transformation equations. Such equations would requiretwo-thirds the data required to represent complex motion. Adding thethird selected pixel (x₃, y₃) from object 204b, the corresponding pixel(x₃ ', y₃ ') from object 204a, and the complete preferred affinetransformation equations allows a user also to represent shear betweensuccessive image frames.

A preferred embodiment of transformation method 350 (FIG. 12) isdescribed as using uniform transformation blocks 356 having dimensionsof, for example, 32×32 pixels. The preferred multi-dimensional affinetransformations described with reference to function block 358 aredetermined with reference to transformation blocks 356. It will beappreciated that the dimensions of transformation blocks 356 directlyaffect the compression ratio provided by this method.

Fewer transformation blocks 356 of relatively large dimensions arerequired to represent transformations of an object between image framesthan the number of transformation blocks 356 having smaller dimensions.A consequence of uniformly large transformation blocks 356 is thatcorrespondingly greater error can be introduced for each transformationblock. Accordingly, uniformly sized transformation blocks 356 typicallyhave moderate dimensions to balance these conflicting performanceconstraints.

TRANSFORMATION BLOCK OPTIMIZATION

FIG. 15 is a functional block diagram of a transformation blockoptimization method 370 that automatically selects transformation blockdimensions that provide a minimal error threshold. Optimization method370 is described with reference to FIG. 16, which is a simplifiedrepresentation of display screen 50 showing a portion of image frame202b with object 204b.

Function block 372 indicates that an initial transformation block 374 isdefined with respect to object 204b. Initial transformation block 374preferably is of maximal dimensions that are selectable by a user andare, for example, 64×64 pixels. Initial transformation block 374 isdesignated the current transformation block.

Function block 376 indicates that a current signal-to-noise ratio (CSNR)is calculated with respect to the current transformation block. Thesignal-to-noise ratio preferably is calculated as the ratio of thevariance of the color component values of the pixel within the currenttransformation block (i.e., the signal) to the variance of the colorcomponents values of the pixels associated with estimated error 98 (FIG.3).

Function block 378 indicates that the current transformation block(e.g., transformation block 374) is subdivided into, for example, fourequal sub-blocks 380a-380d, affine transformations are determined foreach of sub-blocks 380a-380d, and a future signal-to-noise ratio isdetermined with respect to the affine transformations. The futuresignal-to-noise ratio is calculated in substantially the same manner asthe current signal-to-noise ratio described with reference to functionblock 376.

Inquiry block 382 represents an inquiry as to whether the futuresignal-to-noise ratio is greater than the current signal-to-noise ratioby more than a user-selected threshold amount. This inquiry represents adetermination that further subdivision of the current transformationblock (e.g., transformation block 374) would improve the accuracy of theaffine transformations by at least the threshold amount. Whenever thefuture signal-to-noise ratio is greater than the current signal-to-noiseratio by more than the threshold amount, inquiry block 382 proceeds tofunction block 384, and otherwise proceeds to function block 388.

Function block 384 indicates that sub-blocks 380a-380d are successivelydesignated the current transformation block, and each are analyzedwhether to be further subdivided. For purposes of illustration,sub-block 380a is designated the current transformation and processedaccording to function block 376 and further sub-divided into sub-blocks386a-386d. Function block 388 indicates that a next successivetransformation block 374' is identified and designated an initial orcurrent transformation block.

PRECOMPRESSION EXTRAPOLATION METHOD

FIGS. 17A and B are a functional block diagram of a precompressionextrapolation method 400 for extrapolating image features of arbitraryconfiguration to a predefined configuration to facilitate compression inaccordance with function block 112 of encoder process 64 (both of FIG.3). Extrapolation method 400 allows the compression of function block112 to be performed in a conventional manner such as DCT or latticewavelet compression, as described above.

Conventional still image compression methods such a lattice waveletcompression or discrete cosine transforms (DCT) operate upon rectangulararrays of pixels. As described above, however, the methods of thepresent invention are applicable to image features or objects ofarbitrary configuration. Extrapolating such objects or image features toa rectangular pixel array configuration allows use of conventional stillimage compression methods such as lattice wavelet compression or DCT.Extrapolation method 400 is described below with reference to FIGS.18A-18D, which are representations of display screen 50 on which asimple object 402 is rendered to show various aspects of extrapolationmethod 400.

Function block 404 indicates that an extrapolation block boundary 406 isdefined about object 402. Extrapolation block boundary 406 preferably isrectangular. Referring to FIG. 18A, the formation of extrapolation blockboundary 406 about object 402 is based upon an identification of aperimeter 408 of object 402 by, for example, object segmentation method140 (FIG. 4). Extrapolation block boundary 406 is shown encompassingobject 462 in its entirety for purposes of illustration. It will beappreciated that extrapolation block boundary 406 could alternativelyencompass only a portion of object 402. As described with reference toobject segmentation method 140, pixels included in object 402 have colorcomponent values that differ from those of pixels not included in object402.

Function block 410 indicates that all pixels 412 bounded byextrapolation block boundary 406 and not included in object 402 areassigned a predefined value such as, for example, a zero value for eachof the color components.

Function block 414 indicates that horizontal lines of pixels withinextrapolation block boundary 406 are scanned to identify horizontallines with horizontal pixel segments having both zero and non-zero colorcomponent values.

Function block 416 represents an inquiry as to whether the horizontalpixel segments having color component values of zero are bounded at bothends by perimeter 408 of object 402. Referring to FIG. 18B, region 418represents horizontal pixel segments having color component values ofzero that are bounded at both ends by perimeter 408. Regions 420represent horizontal pixel segments that have color component values ofzero and are bounded at only one end by perimeter 408. Function block416 proceeds to function block 426 for regions 418 in which the pixelsegments have color component values of zero bounded at both ends byperimeter 408 of object 402, and otherwise proceeds to function block422.

Function block 422 indicates that the pixels in each horizontal pixelsegment of a region 420 is assigned the color component values of apixel 424 (only exemplary ones shown) in the corresponding horizontallines and perimeter 408 of object 402. Alternatively, the colorcomponent values assigned to the pixels in regions 420 are functionallyrelated to the color component values of pixels 424.

Function block 426 indicates that the pixels in each horizontal pixelsegment in region 418 are assigned color component values correspondingto, and preferably equal to, an average of the color component values ofpixels 428a and 428b that are in the corresponding horizontal lines andon perimeter 408.

Function block 430 indicates that vertical lines of pixels withinextrapolation block boundary 406 are scanned to identify vertical lineswith vertical pixel segments having both zero and non-zero colorcomponent values.

Function block 432 represents an inquiry as to whether the verticalpixel segments in vertical lines having color component values of zeroare bounded at both ends by perimeter 408 of object 402. Referring toFIG. 18C, region 434 represents vertical pixel segments having colorcomponent values of zero that are bounded at both ends by perimeter 408.Regions 436 represent vertical pixel segments that have color componentvalues of zero and are bounded at only one end by perimeter 408.Function block 432 proceeds to function block 444 for region 434 inwhich the vertical pixel segments have color component values of zerobounded at both ends by perimeter 408 of object 402, and otherwiseproceeds to function block 438.

Function block 438 indicates that the pixels in each vertical pixelsegment of region 436 are assigned the color component values of pixels442 (only exemplary ones shown) in the vertical lines and perimeter 408of object 402. Alternatively, the color component values assigned to thepixels in region 436 are functionally related to the color componentvalues of pixels 442.

Function block 444 indicates that the pixels in each vertical pixelsegment in region 434 are assigned color component values correspondingto, and preferably equal to, an average of the color component values ofpixels 446a and 446b that are in the horizontal lines and on perimeter408.

Function block 448 indicates that pixels that are in both horizontal andvertical pixel segments that are assigned color component valuesaccording to this method are assigned composite color component valuesthat relate to, and preferably are the average of, the color componentvalues otherwise assigned to the pixels according to their horizontaland vertical pixel segments.

Examples of pixels assigned such composite color component values arethose pixels in regions 418 and 434.

Function block 450 indicates that regions 452 of pixels bounded byextrapolation block boundary 406 and not intersecting perimeter 408 ofobject 402 along a horizontal or vertical line are assigned compositecolor component values that are related to, and preferably equal to theaverage of, the color component values assigned to adjacent pixels.Referring to FIG. 18D, each of pixels 454 in regions 452 is assigned acolor component value that preferably is the average of the colorcomponent values of pixels 456a and 456b that are aligned with pixel 454along respective horizontal and vertical lines and have non-zero colorcomponent values previously assigned by this method.

A benefit of object extrapolation process 400 is that is assignssmoothly varying color component values to pixels not included in object402 and therefore optimizes the compression capabilities and accuracy ofconventional still image compression methods. In contrast, prior artzero padding or mirror image methods, as described by Chang et al.,"Transform Coding of Arbitrarily-Shaped Image Segments," ACM Multimedia,pp. 83-88, June, 1993, apply compression to extrapolated objects thatare filled with pixels having zero color components values such as thoseapplied in function block 410. The drastic image change than occursbetween an object and the zero-padded regions introduces high frequencychanges that are difficult to compress or introduce image artifacts uponcompression. Object extrapolation method 400 overcomes suchdisadvantages.

ALTERNATIVE ENCODER METHOD

FIG. 19A is a functional block diagram of an encoder method 500 thatemploys a Laplacian pyramid encoder with unique filters that maintainnonlinear aspects of image features, such as edges, while also providinghigh compression. Conventional Laplacian pyramid encoders are described,for example, in the Laplacian Pyramid as a Compact Image Code by Burtand Addleson, IEEE Trans. Comm., Vol. 31, No. 4, pp. 532-540, April1983. Encoder method 500 is capable of providing the encoding describedwith reference to function block 112 of video compression encoderprocess 64 shown in FIG. 3, as well as whenever else DCT on waveletencoding is suggested or used. By way of example, encoder method 500 isdescribed with reference to encoding of estimated error 110 (FIG. 3).

A first decimation filter 502 receives pixel information correspondingto an estimated error 110 (FIG. 3) and filters the pixels according to afilter criterion. In a conventional Laplacian pyramid method, thedecimation filter is a low-pass filter such as a Gaussian weightingfunction. In accordance with encoder method 500, however, decimationfilter 502 preferably employs a median filter and, more specifically, a3×3 nonseparable median filter.

To illustrate, FIG. 20A is a simplified representation of the colorcomponent values for one color component (e.g., red) for an arbitraryset or array of pixels 504. Although described with particular referenceto red color component values, this illustration is similarly applied tothe green and blue color component values of pixels 504.

With reference to the preferred embodiment of decimation filter 502,filter blocks 506 having dimensions of 3×3 pixels are defined amongpixels 504. For each pixel block 506, the median pixel intensity valueis identified or selected. With reference to pixel blocks 506a-506c, forexample, decimation filter 502 provides the respective values of 8, 9,and 10, which are listed as the first three pixels 512 in FIG. 20B.

It will be appreciated, however, that decimation filter 502 could employother median filters according to this invention. Accordingly, for eachgroup of pixels having associated color component values of {a₀, a₁, . .. , a_(n-1) } the median filter would select a median value a_(M).

A first 2×2 down sampling filter 514 samples alternate pixels 512 invertical and horizontal directions to provide additional compression.FIG. 20C represents a resulting compressed set of pixels 515.

A 2×2 up sample filter 516 inserts a pixel of zero value in place ofeach pixel 512 omitted by down sampling filter 514, and interpolationfilter 518 assigns to the zero-value pixel a pixel value of an averageof the opposed adjacent pixels, or a previous assigned value if thezero-value pixel is not between an opposed pair of non-zero valuepixels. To illustrate, FIG. 20D represents a resulting set or array ofvalue pixels 520.

A difference 522 is taken between the color component values of the setof pixels 504 and the corresponding color component values for set ofpixels 520 to form a zero-order image component I₀.

A second decimation filter 526 receives color component valuescorresponding to the compressed set of pixels 515 generated by first 2×2down sampling filter 514. Decimation filter 526 preferably is the sameas decimation filter 502 (e.g., a 3×3 nonseparable median filter).Accordingly, decimation filter 526 functions in the same manner asdecimation filter 502 and delivers a resulting compressed set or arrayof pixels (not shown) to a second 2×2 down sampling filter 528.

Down sampling filter 528 functions in the same manner as down samplingfilter 514 and forms a second order image component L₂ that also isdelivered to a 2×2 up sample filter 530 and an interpolation filter 531that function in the same manner as up sample filter 516 andinterpolation filter 518, respectively. A difference 532 is takenbetween the color component values of the set of pixels 515 and theresulting color component values provided by interpolation filter 531 toform a first-order image component I₁.

The image components I₀, I₁, and L₂ are respective

    n×n, n/2×n/2, n/4×n/4

sets of color component values that represent the color component valuesfor an n×n array of pixels 504.

Image component I₀ maintains the high frequency components (e.g., edges)of an image represented by the original set of pixel 504. Imagecomponents I₁ and L₂ represent low frequency aspects of the originalimage. Image components I₀, I₁ and L₂ provide relative compression ofthe original image. Image component I₀ and I₁ maintain high frequencyfeatures (e.g., edges) in a format that is highly compressible due tothe relatively high correlation between the values of adjacent pixels.Image component L₂ is not readily compressible because it includesprimarily low frequency image features, but is a set of relatively smallsize.

FIG. 19B is a functional block diagram of a decoder method 536 thatdecodes or inverse encodes image components I₀, I₁, and L₂ generated byencoder method 500. Decoder method 536 includes a first 2×2 up samplefilter 538 that receives image component L₂ and interposes a pixel ofzero value between each adjacent pair of pixels. An interpolation filter539 assigns to the zero-value pixel a pixel value that preferably is anaverage of the values of the adjacent pixels, or a previous assignedvalue if the zero-value pixel is not between an opposed pair ofnon-zero-value pixels. First 2×2 up sample filter 538 operates insubstantially the same manner as up sample filters 516 and 530 of FIG.19A, and interpolation filter 539 operates in substantially the samemanner as interpolation filters 518 and 531.

A sum 540 is determined between image component I₁ and the colorcomponent values corresponding to the decompressed set of pixelsgenerated by first 2×2 up sample filter 538 and interpolation filter539. A second 2×2 up sample filter 542 interposes a pixel of zero valuebetween each adjacent pair of pixels generated by sum 540. Aninterpolation filter 543 assigns to the zero-value pixel a pixel valuethat includes an average of the values of the adjacent pixels, or aprevious assigned value if the zero-value pixel is not between anopposed pair of non-zero-value pixels. Up sample filter 542 andinterpolation filter 543 are substantially the same as up sample filter538 and interpolation filter 539, respectively.

A sum 544 sums the image component I₀ with the color component valuescorresponding to the decompressed set of pixels generated by second 2×2up sample filter 542 and interpolation filter 543. Sum 544 providesdecompressed estimated error 110 corresponding to the estimated error110 delivered to encoder process 500.

TRANSFORM CODING OF MOTION VECTORS

Conventional video compression encoder processes, such as MPEG-1 orMPEG-2, utilize only sparse motion vector fields to represent the motionof significantly larger pixel arrays of a regular size andconfiguration. The motion vector fields are sparse in that only onemotion vector is used to represent the motion of a pixel array havingdimensions of, for example, 16×16 pixels. The sparse motion vectorfields, together with transform encoding of underlying images or pixelsby, for example, discrete cosine transform (DCT) encoding, provideconventional video compression encoding.

In contrast, video compression encoding process 64 (FIG. 3) utilizesdense motion vector fields in which motion vectors are determined forall, or virtually all, pixels of an object. Such dense motion vectorfields significantly improve the accuracy with which motion betweencorresponding pixels is represented. Although the increased accuracy cansignificantly reduce the errors associated with conventional sparsemotion vector field representations, the additional information includedin dense motion vector fields represent an increase in the amount ofinformation representing a video sequence. In accordance with thisinvention, therefore, dense motion vector fields are themselvescompressed or encoded to improve the compression ratio provided by thisinvention.

FIG. 21 is a functional block diagram of a motion vector encodingprocess 560 for encoding or compressing motion vector fields and,preferably, dense motion vector fields such as those generated inaccordance with dense motion transformation 96 of FIG. 3. It will beappreciated that such dense motion vector fields from a selected objecttypically will have greater continuity or "smoothness" than theunderlying pixels corresponding to the object. As a result, compressionor encoding of the dense motion vector fields will attain a greatercompression ratio than would compression or encoding of the underlyingpixels.

Function block 562 indicates that a dense motion vector field isobtained for an object or a portion of an object in accordance with, forexample, the processes of function block 96 described with reference toFIG. 3. Accordingly, the dense motion vector field will correspond to anobject or other image portion of arbitrary configuration or size.

Function block 564 indicates that the configuration of the dense motionvector field is extrapolated to a regular, preferably rectangular,configuration to facilitate encoding or compression. Preferably, thedense motion vector field configuration is extrapolated to a regularconfiguration by precompression extrapolation method 400 described withreference to FIGS. 17A and 17B. It will be appreciated that conventionalextrapolation methods, such as a mirror image method, couldalternatively be utilized.

Function block 566 indicates that the dense motion vector field with itsextrapolated regular configuration is encoded or compressed according toconventional encoding transformations such as, for example, discretecosine transformation (DCT) or lattice wavelet compression, the formerof which is preferred.

Function block 568 indicates that the encoded dense motion vector fieldis further compressed or encoded by a conventional lossless still imagecompression method such as entropy encoding to form an encoded densemotion vector field 570. Such a still image compression method isdescribed with reference to function block 114 of FIG. 3.

COMPRESSION OF QUANTIZED OBJECTS FROM PREVIOUS VIDEO FRAMES

Referring to FIG. 3, video compression encoder process 64 uses quantizedprior object 98 determined with reference to a prior frame N-1 to encodea corresponding object in a next successive frame N. As a consequence,encoder process 64 requires that quantized prior object 98 be stored inan accessible memory buffer. With conventional video displayresolutions, such a memory buffer would require a capacity of at leastone megabyte to store the quantized prior object 98 for a single videoframe. Higher resolution display formats would require correspondinglylarger memory buffers.

FIG. 22 is a functional block diagram of a quantized objectencoder-decoder (codec) process 600 that compresses and selectivelydecompresses quantized prior objects 98 to reduce the required capacityof a quantized object memory buffer.

Function block 602 indicates that each quantized object 98 in an imageframe is encoded on a block-by-block manner by a lossy encoding orcompression method such as discrete cosine transform (DCT) encoding orlattice sub-band (wavelet) compression.

Function block 604 indicates that the encoded or compressed quantizedobjects are stored in a memory buffer (not shown).

Function block 606 indicates that encoded quantized objects areretrieved from the memory buffer in anticipation of processing acorresponding object in a next successive video frame.

Function block 608 indicates that the encoded quantized object isinverse encoded by, for example, DCT or wavelet decoding according tothe encoding processes employed with respect to function block 602.

Codec process 600 allows the capacity of the corresponding memory bufferto be reduced by up to about 80%. Moreover, it will be appreciated thatcodec process 600 would be similarly applicable to the decoder processcorresponding to video compression encoder process 64.

VIDEO COMPRESSION DECODER PROCESS OVERVIEW

Video compression encoder process 64 of FIG. 3 provides encoded orcompressed representations of video signals corresponding to videosequences of multiple image frames. The compressed representationsinclude object masks 66, feature points 68, affine transformcoefficients 104, and compressed error data 116 from encoder process 64and compressed master objects 136 from encoder process 130. Thesecompressed representations facilitate storage or transmission of videoinformation, and are capable of achieving compression ratios of up to300 percent greater than those achievable by conventional videocompression methods such as MPEG-2.

It will be appreciated, however, that retrieving such compressed videoinformation from data storage or receiving transmission of the videoinformation requires that it be decoded or decompressed to reconstructthe original video signal so that it can be rendered by a display devicesuch as video display device 52 (FIGS. 2A and 2B). As with conventionalencoding processes such as MPEG-1, MPEG-2, and H.26X, the decompressionor decoding of the video information is substantially the inverse of theprocess by which the original video signal is encoded or compressed.

FIG. 23A is a functional block diagram of a video compression decoderprocess 700 for decompressing video information generated by videocompression encoder process 64 of FIG. 3. For purposes of consistencywith the description of encoder process 64, decoder process 700 isdescribed with reference to FIGS. 2A and 2B. Decoder process 700retrieves from memory or receives as a transmission encoded videoinformation that includes object masks 66, feature points 68, compressedmaster objects 136, affine transform coefficients 104, and compressederror data 116.

Decoder process 700 performs operations that are the inverse of those ofencoder process 64 (FIG. 3). Accordingly, each of the above-describedpreferred operations of encoder process 64 having a decoding counterpartwould similarly be inversed.

Function block 702 indicates that masks 66, feature points 68, transformcoefficients 104, and compressed error data 116 are retrieved frommemory or received as a transmission for processing by decoder process700.

FIG. 23B is a functional block diagram of a master object decoderprocess 704 for decoding or decompressing compressed master object 136.Function block 706 indicates that compressed master object data 136 areentropy decoded by the inverse of the conventional lossless entropyencoding method in function block 134 of FIG. 3B. Function block 708indicates that the entropy decoded master object from function block 706is decoded according to an inverse of the conventional lossy waveletencoding process used in function block 132 of FIG. 3B.

Function block 712 indicates that dense motion transformations,preferably multi-dimensional affine transformations, are generated fromaffine coefficients 104. Preferably, affine coefficients 104 arequantized in accordance with transformation method 350 (FIG. 12), andthe affine transformations are generated from the quantized affinecoefficients by performing the inverse of the operations described withreference to function block 362 (FIG. 12).

Function block 714 indicates that a quantized form of an object 716 in aprior frame N-1 (e.g., rectangular solid object 56a in image frame 54a)provided via a timing delay 718 is transformed by the dense motiontransformation to provide a predicted form of the object 720 in acurrent frame N (e.g., rectangular solid object 56b in image frame 54b).

Function block 722 indicates that for image frame N, predicted currentobject 720 is added to a quantized error 724 generated from compressederror data 116. In particular, function block 726 indicates thatcompressed error data 116 is decoded by an inverse process to that ofcompression process 114 (FIG. 3A). In the preferred embodiment, functionblocks 114 and 726 are based upon a conventional lossless still imagecompression method such as entropy encoding.

Function block 728 indicates that the entropy decoded error data fromfunction block 726 is further decompressed or decoded by a conventionallossy still image compression method corresponding to that utilized infunction block 112 (FIG. 3A). In the preferred embodiment, thedecompression or decoding of function block 728 is by a lattice subband(wavelet) process or a discrete cosine transform (DCT) process.

Function block 722 provides quantized object 730 for frame N as the sumof predicted object 720 and quantized error 724, representing areconstructed or decompressed object 732 that is delivered to functionblock 718 for reconstruction of the object in subsequent frames.

Function block 734 indicates that quantized object 732 is assembled withother objects of a current image frame N to form a decompressed videosignal.

SIMPLIFIED CHAIN ENCODING

Masks, objects, sprites, and other graphical features, commonly arerepresented by their contours. As shown in and explained with referenceto FIG. 5A, for example, rectangular solid object 56a is bounded by anobject perimeter or contour 142. A conventional process or encoding orcompressing contours is referred to as chain encoding.

FIG. 24A shows a conventional eight-point chain code 800 from whichcontours on a conventional recta-linear pixel array are defined. Basedupon a current pixel location X, a next successive pixel location in thecontour extends in one of directions 802a-802h. The chain code value forthe next successive pixel is the numeric value corresponding to theparticular direction 802. As examples, the right, horizontal direction802a corresponds to the chain code value 0, and the downward, verticaldirection 802g corresponds to the chain code value 6. Any continuouscontour can be described from eight-point chain code 800.

With reference to FIG. 24B, a contour 804 represented by pixels 806designated X and A-G can be encoded in a conventional manner by thechain code sequence {00764432}. In particular, beginning from pixel X,pixels A and B are positioned in direction 0 relative to respectivepixels X and A. Pixel C is positioned in direction 7 relative to pixelB. Remaining pixels D-G are similarly positioned in directionscorresponding to the chain code values listed above. In a binaryrepresentation, each conventional chain code value is represented bythree digital bits.

FIG. 25A is a functional block diagram of a chain code process 810 ofthe present invention capable of providing contour compression ratios atleast about twice those of conventional chain code processes. Chain codeprocess 810 achieves such improved compression ratios by limiting thenumber of chain codes and defining them relative to the alignment ofadjacent pairs of pixels. Based upon experimentation, it has beendiscovered that the limited chain codes of chain code process 810directly represent more than 99.8% of pixel alignments of object or maskcontours. Special case chain code modifications accommodate theremaining less than 0.2% of pixel alignment as described below ingreater detail.

Function block 816 indicates that a contour is obtained for a mask,object, or sprite. The contour may be obtained, for example, by objectsegmentation process 140 described with reference to FIGS. 4 and 5.

Function block 818 indicates that an initial pixel in the contour isidentified. The initial pixel may be identified by common methods suchas, for example, a pixel with minimal X-axis and Y-axis coordinatepositions.

Function block 820 indicates that a predetermined chain code is assignedto represent the relationship between the initial pixel and the nextadjacent pixel in the contour. Preferably, the predetermined chain codecorresponds to a forward direction.

FIG. 25B is a diagrammatic representation of a three-point chain code822 of the present invention. Chain code 822 includes three chain codes824a, 824b, and 824c that correspond to a forward direction 826a, aleftward direction 826b, and a rightward direction 826c, respectfully.Directions 826a-826c are defined relative to a preceding alignmentdirection 828 between a current pixel 830 and an adjacent pixel 832representing the preceding pixel in the chain code.

Preceding alignment direction 828 may extend in any of the directions802 shown in FIG. 24A, but is shown with a specific orientation (i.e.,right, horizontal) for purposes of illustration. Direction 826a isdefined, therefore, as the same as direction 828. Directions 826b and826c differ from direction 828 by leftward and rightward displacementsof one pixel.

It has been determined experimentally that slightly more than 50% ofchain codes 824 correspond to forward direction 826a, and slightly lessthan 25% of chain codes 824 correspond to each of directions 826b and826c.

Function block 836 represents an inquiry as to whether the next adjacentpixel in the contour conforms to one of directions 826. Whenever thenext adjacent pixel in the contour conforms to one of directions 826,function block 836 proceeds to function block 838, and otherwiseproceeds to function block 840.

Function block 838 indicates that the next adjacent pixel is assigned achain code 824 corresponding to its direction 826 relative to thedirection 828 along which the adjacent preceding pair of pixels arealigned.

Function block 840 indicates that a pixel sequence conforming to one ofdirections 826 is substituted for the actual nonconformal pixelsequence. Based upon experimentation, it has been determined that suchsubstitutions typically will arise in fewer than 0.2% of pixel sequencesin a contour and may be accommodated by one of six special-casemodifications.

FIG. 25C is a diagrammatic representation of the six special-casemodifications 842 for converting non-conformal pixel sequences to pixelsequences that conform to directions 826. Within each modification 842,a pixel sequence 844 is converted to a pixel sequence 846. In each ofpixel sequences 844 of adjacent respective pixels X¹, X², A, B, thedirection between pixels A and B does not conform to one of directions826 due to the alignment of pixel A relative to the alignment of pixelsX¹ and X².

In pixel sequence 844a, initial pixel alignments 850a and 852a representa nonconformal right-angle direction change. Accordingly, in pixelsequence 846a, pixel A of pixel sequence 844a is omitted, resulting in apixel direction 854a that conforms to pixel direction 826a. Pixelsequence modifications 842b-842f similarly convert nonconformal pixelsequences 844b-844f to conformal sequences 846b-846f, respectively.

Pixel sequence modifications 842 omit pixels that cause pixel directionalignments that change by 90° or more relative to the alignments ofadjacent preceding pixels X1 and X2. One effect is to increase theminimum radius of curvature of a contour representing a right angle toover three pixels. Pixel modifications 842 cause, therefore, a minorloss of extremely fine contour detail. According to this invention,however, it has been determined that the loss of such details isacceptable under most viewing conditions.

Function block 860 represents an inquiry as to whether there is anotherpixel in the contour to be assigned a chain code. Whenever there isanother pixel in the contour to be assigned a chain code, function blockreturns to function block 836, and otherwise proceeds to function block862.

Function block 862 indicates that nonconformal pixel alignmentdirections introduced or incurred by the process of function block 840are removed. In a preferred embodiment, the nonconformal directionchanges may be omitted simply by returning to function block 816 andrepeating process 810 until no nonconformed pixel sequences remain,which typically is achieved in fewer than 8 iterations. In analternative embodiment, such incurred nonconformal direction changes maybe corrected in "real-time" by checking for and correcting any incurrednonconformal direction changes each time a nonconformal direction changeis modified.

Function block 864 indicates that a Huffman code is generated from theresulting simplified chain code. With chain codes 824a-824ccorresponding to directions 826A-826C that occur for about 50%, 25% and25% of pixels in a contour, respective Huffman codes of 0, 11, and 10are assigned. Such first order Huffman codes allow chain process-810 torepresent contours at a bit rate of less than 1.5 bits per pixel in thecontour. Such a bitrate represents approximately a 50% compression ratioimprovement over conventional chain code processes.

It will be appreciated that higher order Huffman coding could providehigher compression ratios. Higher order Huffman coding includes, forexample, assigning predetermined values to preselected sequences offirst order Huffman codes.

SPRITE GENERATION

The present invention includes generating sprites for use in connectionwith encoding determinate motion video (movie). Bitmaps are accretedinto bitmap series that comprise a plurality of sequential bitmaps ofsequential images from an image source. Accretion is used to overcomethe problem of occluded pixels where objects or figures move relative toone another or where one figure occludes another similar to the way aforeground figure occludes the background. For example, when aforeground figure moves and reveals some new background, there is no wayto build that new background from a previous bitmap unless the previousbitmap was first enhanced by including in it the pixels that were goingto be uncovered in the subsequent bitmap. This method takes anincomplete image of a figure and looks forward in time to find anypixels that belong to the image but are not to be immediately visible.Those pixels are used to create a composite bitmap for the figure. Withthe composite bitmap, any future view of the figure can be created bydistorting the composite bitmap.

The encoding process begins by an operator identifying the figures andthe parts of the figures of a current bitmap from a current bitmapseries. Feature or distortion points are selected by the operator on thefeatures of the parts about which the parts of the figures move. Acurrent grid of triangles is superimposed onto the parts of the currentbitmap. The triangles that constitute the current grid of triangles areformed by connecting adjacent distortion points. The distortion pointsare the vertices of the triangles. The current location of each triangleon the current bitmap is determined and stored to the storage device. Aportion of data of the current bitmap that defines the first imagewithin the current location of each triangle is retained for furtheruse.

A succeeding bitmap that defines a second image of the current bitmapseries is received from the image source, and the figures and the partsof the figure are identified by the operator. Next, the current grid oftriangles from the current bitmap is superimposed onto the succeedingbitmap. The distortion points of current grid of triangles are realignedto coincide with the features of the corresponding figures on thesucceeding bitmap. The realigned distortion points form a succeedinggrid of triangles on the succeeding bitmap of the second image. Thesucceeding location of each triangle on the succeeding bitmap isdetermined and stored to the storage device. A portion of data of thesucceeding bitmap that defines the second image within the succeedinglocation of each triangle is retained for further use.

The process of determining and storing the current and succeedinglocations of each triangle is repeated for the plurality of sequentialbitmaps of the current bitmap series. When that process is completed, anaverage image of each triangle in the current bitmap series isdetermined from the separately retained data. The average image of eachtriangle is stored to the storage device.

During playback, the average image of each triangle of the currentbitmap series and the current location of each triangle of the currentbitmap are retrieved from the storage device. A predicted bitmap isgenerated by calculating a transformation solution for transforming theaverage image of each triangle in the current bitmap series to thecurrent location of each triangle of the current bitmap and applying thetransformation solution to the average image of each triangle. Thepredicted bitmap is passed to the monitor for display.

In connection with a playback determinate motion video (video game) inwhich the images are determined by a controlling program at playback, asprite bitmap is stored in its entirety on a storage device. The spritebitmap comprises a plurality of data bits that define a sprite image.The sprite bitmap is displayed on a monitor, and the parts of the spriteare identified by an operator and distortion points are selected for thesprite's parts.

A grid of triangles is superimposed onto the parts of the sprite bitmap.The triangles that constitute the grid of triangles are formed byconnecting adjacent distortion points. The distortion points are thevertices of the triangles. The location of each triangle of the spritebitmap is determined and stored to the storage device.

During playback, a succeeding location of each triangle is received froma controlling program. The sprite bitmap and the succeeding location ofeach triangle on the sprite bitmap are recalled from the storage deviceand passed to the display processor. The succeeding location of eachtriangle is also passed to the display processor.

A transformation solution is calculated for each triangle on the spritebitmap. A succeeding bitmap is then generated in the display processorby applying the transformation solution of each triangle derived fromthe sprite bitmap the defines the sprite image within the location ofeach triangle. The display processor passes the succeeding sprite bitmapto a monitor for display. This process is repeated for each succeedinglocation of each triangle requested by the controlling program.

As shown in FIG. 26, an encoding procedure for a movie motion videobegins at step 900 by the CPU 22 receiving from an image source acurrent bitmap series. The current bitmap series comprises a pluralityof sequential bitmaps of sequential images. The current bitmap serieshas a current bitmap that comprises a plurality of data bits whichdefine a first image from the image source. The first image comprises atleast one figure having at least one part.

Proceeding to step 902, the first image is displayed to the operator onthe monitor 28. From the monitor 28, the figures of the first image onthe current bitmap are identified by the operator. The parts of thefigure on the current bitmap are then identified by the operator at step904.

Next, at step 906, the operator selects feature or distortion points onthe current bitmap. The distortion points are selected so that thedistortion points coincide with features on the bitmap where relativemovement of a part is likely to occur. It will be understood by thoseskilled in the art that the figures, the parts of the figures and thedistortion points on a bitmap may be identified by the computer system20 or by assistance from it. It is preferred, however, that the operatoridentify the figures, the parts of the figures and the distortion pointson a bitmap.

Proceeding to step 908, a current grid of triangles is superimposed ontothe parts of the current bitmap by the computer system 20. Withreference to FIG. 27A, the current grid comprises triangles formed byconnecting adjacent distortion points. The distortion points form thevertices of the triangles. More specifically, the first image of thecurrent bit map comprises a figure, which is a person 970. The person970 has six parts corresponding to a head 972, a torso 974, a right arm976, a left arm 978, right leg 980, and a left leg 982. Distortionpoints are selected on each part of the person 970 so that thedistortion points coincide with features where relative movement of apart is likely to occur. A current grid is superimposed over each partwith the triangles of each current grid formed by connecting adjacentdistortion points. Thus, the distortion points form the vertices of thetriangles.

At step 910, the computer system 20 determines a current location ofeach triangle on the current bitmap. The current location of eachtriangle on the current bitmap is defined by the location of thedistortion points that form the vertices of the triangle. At step 912,the current location of each triangle is stored to the storage device. Aportion of data derived from the current bitmap that defines the firstimage within the current location of each triangle is retained at step914.

Next, at step 916, a succeeding bitmap of the current bitmap series isreceived by the CPU 22. The succeeding bitmap comprises a plurality ofdata bits which define a second image of the current bitmap series. Thesecond image may or may not include figures that correspond to thefigures in the first image. For the following steps, the second image isassumed to have figures that corresponds to the figures in the firstimage. At step 918, the current grid of triangles is superimposed ontothe succeeding bitmap. The second image with the superimposed triangulargrid is displayed to the operator on the monitor 28.

At step 920, the distortion points are realigned to coincide withcorresponding features on the succeeding bitmap by the operator withassistance from the computer system 20. The computer system 20 realignsthe distortion using block matching. Any mistakes are corrected by theoperator. With reference to FIG. 27B, the realigned distortion pointsform a succeeding grid of triangles. The realigned distortion points arethe vertices of the triangles. More specifically, the second image ofthe succeeding bitmap of person 200 includes head 972, torso 974, rightarm 976, left arm 978, right leg 980, and left leg 982. In the secondimage, however, the right arm 980 is raised. The current grids of thefirst image have been superimposed over each part and their distortionpoints realigned to coincide with corresponding features on the secondimage. The realigned distortion points define succeeding grids oftriangles. The succeeding grids comprise triangles formed by connectingthe realigned distortion points. Thus, the realigned distortion pointform the vertices of the triangles of the succeeding grids.

Proceeding to step 922, a succeeding location of each triangle of thesucceeding bitmap is determined by the computer system 20. At step 924,the succeeding location of each triangle on the succeeding bitmap isstored the storage device. A portion of data derived from the succeedingbitmap that defines the second image within the succeeding location ofeach triangle is retained at step 926. Step 926 leads to decisional step928 where it is determined if a next succeeding bitmap exists.

If a next succeeding bitmap exists, the YES branch of decisional step928 leads to step 930 where the succeeding bitmap becomes the currentbitmap. Step 930 returns to step 916 where a succeeding bitmap of thecurrent bitmap series is received by the CPU 22. If a next succeedingbitmap does not exist, the NO branch of decisional step 928 leads tostep 932 where an average image for each triangle of the current bitmapseries is determined. The average image is the median value of thepixels of a triangle. Use of the average image makes the process lesssusceptible to degeneration. Proceeding to step 934, the average imageof each triangle of the current bitmap series is stored to the storagedevice.

Next, at step 936, the current location of each triangle on the currentbitmap is retrieved from the storage device. An affine transformationsolution for transforming the average image of each triangle to thecurrent location of is triangle on the current bitmap is then calculatedby the computer system 20 at step 938. At step 940, a predicted bitmapis generated by applying the transformation solution of the averageimage of each triangle to the current location of each triangle on thecurrent bitmap. The predicted bitmap is compared with the current bitmapat step 942.

At step 944 a correction bitmap is generated. The corrected bitmapcomprises the data bits of the current bitmap that were not accuratelypredicted by the predicted bitmap. The corrected bitmap is stored to thestorage device at step 948. Step 948 leads to decisional step 950 whereit is determined if a succeeding bitmap exists.

If a succeeding bitmap exists, the YES branch of decisional step 950leads to step 952 where the succeeding bitmap becomes the currentbitmap. Step 952 returns to step 936 where the current location of eachtriangle on the current bitmap is retrieved from the storage device. Ifa next succeeding bitmap does not exist, the No branch of decisionalstep 950 leads to decisional step 954 where it is determined if asucceeding bitmap series exists. If a succeeding bitmap series does notexist, encoding is finished and the NO branch of decisional step 954leads to step 956. If a succeeding bitmap series exists, the YES branchof decisional step 954 leads to step 958 where the CPU 22 receives thesucceeding bitmap series as the current bitmap series. Step 956 returnsto step 902 where the figures of the first image of the current bitmapseries is identified by the operator.

The process of FIG. 26 describes generation of a sprite or master object9o for use by encoder process 64 of FIG. 3. The process of utilizingmaster object 90 to form predicted objects 102 is described withreference to FIG. 28.

As shown in FIG. 28, the procedure begins at step 1000 with a currentbitmap series being retrieved. The current bitmap series comprises aplurality of sequential bitmaps of sequential images. The current bitmapseries has a current bitmap that comprises a plurality of data bitswhich define a first image from the image source. The first imagecomprises at least one figure having at least one part.

At step 1002, the average image of each triangle of the current bitmapseries is retrieved from the storage device. The average image of eachtriangle is then passed to a display processor (not shown) at step 704.It will be appreciated that computer system 20 (FIG. 1) can optionallyinclude a display processor or other dedicated components for executingfor processes of this invention. Proceeding to step 1006, the currentlocation of each triangle on the current bitmap is retrieved from thestorage device. The current location of each triangle is passed to thedisplay processor at step 1008.

Next, an affine transformation solution for transforming the averageimage of each triangle to the current location of each triangle on thecurrent bitmap is calculated by the display processor at step 1010.Proceeding to step 1012, a predicted bitmap is generated by the displayprocessor by applying the transformation solution for transforming theaverage image of each triangle to the current location of each triangleon the current bitmap.

At step 1014, a correction bitmap for the current bitmap is retrievedfrom the storage device. The correction bitmap is passed to the displayprocessor at step 716. A display bitmap is then generated in the displayprocessor by overlaying the predicted bitmap with the correction bitmap.The display processor retains a copy of the average image of eachtriangle and passes the display bitmap to the frame buffer for displayon the monitor.

Next, at decisional step 1020, it is determined if a succeeding bitmapof the current bitmap series exists. If a succeeding bitmap of thecurrent bitmap series exists, the YES branch of decisional step 1020leads to step 1022. At step 1022, the succeeding bitmap becomes thecurrent bitmap. Step 1022 returns to step 1006 where the location ofeach triangle on the current bitmap is retrieved from the storagedevice.

Returning to decisional step 1020, if a succeeding bitmap of the currentbitmap series does not exist, the NO branch of decisional step 1020leads to decisional step 1024. At decisional step 1024, it is determinedif a succeeding bitmap series exists. If a succeeding bitmap series doesnot exist, then the process is finished and the NO branch of decisionalstep 1024 leads to step 1026. If a succeeding bitmap series exists, theYES branch of decisional step 1024 leads to step 1028. At step 1028, thesucceeding bitmap series becomes the current bitmap series. Step 1028returns to step 1000.

ERROR SIGNAL SUPPRESSION

Motion estimation/compensation used in video compression tends to berelatively inaccurate around the boundary of an object in a video image.The inaccuracies are caused by the typically large changes in luminanceand chromaticity at object boundaries and are referred to as highfrequency impulse noise. In addition, random noise is generated as anormal consequence of data conversion and processing characteristic ofvideo signal compression.

Random and high frequency impulse noises result in large error signalsthat limit the efficiency or ratio at which video signals can becompressed. Fixed clipping or discarding of the error signals, orportions of them, typically affects adversely the quality of theresulting compressed video signal. High frequency impulse noise includesinformation relating to the video signal or data. Fixed clipping ordiscarding of high frequency impulse noise also discards video datainformation in the compression error, thereby reducing the overallquality of the compressed video image. The adverse affects of suchclipping or discarding can be particularly severe if the videocompression encoding method employs an error feedback loop 118 (see FIG.3A).

Estimated error signal 110 (FIG. 3A) can comprise up to between 80% and95% of a bitstream representing a compressed video signal. Estimatederror signal 110 (i.e., the compression error signal) includes randomnoise and high frequency impulse noise that usually results from motionestimation during video processing. Higher frequency noise is typicallydetrimental to a compression scheme using frequency based encoders(e.g., the wavelet coder 112 shown in FIG. 3A, a DCT coder, etc.) sincethe noise requires higher resolutions of encoded information thatdramatically increase the required bitrate. Moreover, frequencydiscrimination is typically sacrificed for time localization at higherlevels.

Reducing the resolution of the error signal (e.g., by removing randomand high frequency noise components) causes the overall bitrate requiredfor estimated error signal 110 to be reduced, thereby resulting in moreefficient and faster video compression and transmission. The resolutionof the error signal can be reduced by disregarding random and highfrequency error signals not important to human visual perception.Eliminating high frequency components or "energy" of the error signalunimportant to human visual perception dramatically reduces the overallcompression error bitrate without adversely affecting the overall visualquality of the video signal.

FIG. 29 is a simplified block diagram representing a portion of videocompression encoder process 64 (FIG. 3A) as modified to include an errorsignal suppressor 1044 according to a preferred embodiment of thepresent invention. It will be appreciated that video compression encoderprocess 64 as modified provides a preferred operating environment forerror signal suppressor 1044, but that error signal suppressor 1044 isapplicable to and has utility in other video compression encoderprocesses. Error signal suppressor 1044 reduces the resolution requiredto represent estimated error signal 110 before it is passed to thewavelet coder 112.

Referring to FIG. 30, error signal suppressor 1044 includes an errorthresholder 1044a and a cross-shaped median filter 1044b. Errorthresholder 1044a removes random noise that is normally present in thecompression error signal as a result of analog-to-digital conversion,quantization errors from signal sampling, etc.

The error thresholder 1044a is defined by the following equation:

    if |E|<T, then E=0

    if |E|>=T, then E=E

If the absolute value of the estimated error signal E is less than T, apredetermined error threshold value, then the error signal E is set tozero. If the absolute value of the estimated error signal E is greaterthan or equal to predetermined error threshold value T, then theestimated error signal E is kept as the original value E.

If a good prediction of the representation of an actual object is madeby an approximate object, the estimated error signal will have a valuevery close to zero. As a result, the error threshold value T is set to asmall value (e.g. T=10) to eliminate random noise.

FIG. 31A is a diagrammatic representation of high and low frequencynoise components 1048 and 1050 of an error signal E. It will beappreciated that the error signal E corresponds to a set of pixel valuesfor a selected set pixels. As a result, high and low frequency noisecomponents 1048 and 1050 would be integrated into a common displaysignal. The diagrammatic representation shows the relative magnitudes oftwo of typically multiple frequency components of the error signal E.

Random noise 1048 is removed from the compression error signal 1050 bythe error thresholder 1044a. As can be seen from FIG. 31A, the randomnoise component 1048 with a magnitude which falls within the absolutevalue of the error threshold T (shown by the dashed lines 1052) isremoved by the error thresholder 1044a. FIG. 31B is a diagrammaticrepresentation of the resulting filtered estimated error signal 1054that is passed on without the random noise 1056 (i.e. with the originalrandom noise 1048 set to a value of zero by the error thresholder1044a), thus reducing a portion of the estimated error signal bitrate.

After passing the compression error signal E through the errorthresholder 1044a, a cross-shaped median filter 1044b is then applied tothe pixels associated with the estimated error signal E. Cross-shapedmedian filter 1044b reduces impulse noise (i.e., a large change in theerror signal over a short spatial or temporal range) within theestimated error signal E. Reducing impulse noise softens the appearanceof the edge of an object in a video image when motion estimation is usedand also significantly reduces the estimated error signal bitstream.

The cross-shaped median filter 1044b is used to find the median pixelvalue of the pixel values associated with five pixels X(i,j) positionedtogether in a cross shape. With reference to FIG. 32A, cross-shapedmedian filter 1044b is applied to each pixel X(n,m) represented by theerror signal E relative to the adjacent pixels X(n,m-1), X(n,m+1),X(n-1,m) and X(n+1,m). Preferably, the median pixel value is determinedwith respect to each of the Y, U, and V components of a YUV uniformcolor space in which Y represents luminance and UV representchromaticity, as is known in the art.

FIG. 32B shows five exemplary luminance component pixel values Yassociated with particular pixels as X(n,m)=10, X(n,m-1)=180,X(n,m+1)=250, X(n-1,m)=15, and X(n+1,m)=255. Cross-shaped median filter1044b' provides as the median or middle value of the five exemplaryluminance component pixel values Y the median M of (10,15,180,250,255)or Median=180. Thus, the median luminance component pixel value Y of 180would be assigned to each of the pixels X(n,m), X(n,m-1), X(n,m+1),X(n-1,m) and X(n+1,m) shown in FIGS. 32A and 32B.

Assigning the median luminance component pixel value Y of 180 to thepixels X(n,m), X(n,m-1), X(n,m+1), X(n-1,m) and X(n+1,m) substantiallyeliminates the high frequency impulse noise that otherwise would begenerated between the minimum pixel value 10 and the maximum pixelvalues 250 and 255. A consequence of such filtering is that the detailedimage information relating to the particular pixel values is lost ordiscarded. A benefit of the present invention, however, is that theconfiguration and size of cross-shaped median filter 1044b allows thisimage information to be lost without discernible adverse affects onimage quality. Thus, a portion of the impulse noise which would haveoccurred is eliminated and the overall bitrate required for theestimated error signal 110 is reduced.

In the preferred embodiment of the present invention, five pixels areused to create the cross shape used for median filtering. A cross shapeformed from a smaller or larger number of pixels can also be used formedian filtering. However, using less than five pixels removes too muchof the estimated error signal and affects the overall visual quality ofthe output signal. Using more than five pixels will further reduce theoverall estimated error bitrate, but will also increase the processingtime required within the error signal suppressor block 1044. If too manypixels are used in the cross-shaped median filter, then any savingsgained from a smaller estimated error signal bitrate will beovershadowed by the increase in time it takes to process data within theerror signal suppression block 1044, which will actually decreaseoverall video compression and transmission rates.

Combining the use of a error threshold and a five pixel cross-shapedmedian filter in the error signal suppressor block 1044, reduces theoverall bitrate of the estimated error signal up to between 10% and 20%,without any significant lost of visual quality in the video image. Sincethe overall estimated error signal bitrate is reduced, video compressionand transmission rates are increased, speeding up the video compressionprocess.

Having illustrated and described the principles of the present inventionin a preferred embodiment, it should be apparent to those skilled in theart that the embodiment can be modified in arrangement and detailwithout departing from such principles. Accordingly, we claim as ourinvention all such embodiments as come within the scope and spirit ofthe following claims and equivalents thereto.

we claim:
 1. A video compression filtering method for a videocompression error signal, the error signal including the differencesbetween the representations of an actual and approximate video object,the method comprising:applying a random noise filter to said videocompression error signal to form a first filtered error signal withreduced random noise; applying an impulse noise filter to said firstfiltered error signal to form a second filtered error signal withreduced high frequency impulse noise; and using the second filterederror signal in a video compression encoding scheme.
 2. The method ofclaim 1 where the random noise filter includes a threshold filter. 3.The method of claim 1 where the impulse noise filter includes across-shaped median filter.
 4. The method of claim 3 where thecross-shaped median filter is a five pixel cross-shaped median filter.5. The method of claim 1 where the object is of arbitrary configuration.6. A compression filtering method for a video compression error signal,the video compression error signal representing differences betweenrepresentations of an actual object and an approximate object, themethod comprising:applying a predetermined error threshold filter to thevideo compression error signal to form a first filtered videocompression error signal; identifying a group of plural pixelsrepresenting said first filter video compression error signal; applyinga median filter to said group of plural pixels to determine a medianpixel value; and assigning said median pixel value to each of the pixelsin said group of plural pixels to form a modified pixel group.
 7. Themethod of claim 6 where applying a predetermined error threshold filterto the video compression error signal includes setting said videocompression signal to magnitude zero whenever said video compressionerror signal is of a magnitude less than said predetermined errorthreshold.
 8. The method of claim 6 where the median filter includes across-shaped median filter.
 9. The method of claim 8 where thecross-shaped median filter is a five pixel cross-shaped median filter.10. The method of claim 6 where the plural pixels have luminance andchromaticity values and median pixel values are determined with respectto the pixel luminance and chromaticity values.
 11. The method of claim6 where plural pixels have RGB color coordinate values and median pixelvalues are determined with respect to RGB color coordinate values. 12.The method of claim 6 where the object is of arbitrary configuration.13. A computer readable medium having stored therein instructions forcausing a computer to execute the method of claim
 1. 14. A computerreadable medium having stored therein instructions for causing acomputer to execute the method of claim 6.